Package org.drip.graph.treebuilder

Class CapacitatedMSTGenerator

java.lang.Object
org.drip.graph.treebuilder.OptimalSpanningForestGenerator
org.drip.graph.treebuilder.CapacitatedMSTGenerator
public abstract class CapacitatedMSTGenerator
extends OptimalSpanningForestGenerator
CapacitatedMSTGenerator exposes the Functionality behind the Capacitated MST Generation for a given Graph and Vertex Capacity. The References are:

  • Bader, D. A., and G. Cong (2006): Fast Shared Memory Algorithms for computing the Minimum Spanning Forests of Sparse Graphs Journal of Parallel and Distributed Computing 66 (11) 1366-1378
  • Chazelle, B. (2000): A Minimum Spanning Tree Algorithm with Inverse-Ackerman Type Complexity Journal of the Association for Computing Machinery 47 (6) 1028-1047
  • Karger, D. R., P. N. Klein, and R. E. Tarjan (1995): A Randomized Linear-Time Algorithm to find Minimum Spanning Trees Journal of the Association for Computing Machinery 42 (2) 321-328
  • Pettie, S., and V. Ramachandran (2002): An Optimal Minimum Spanning Tree Algorithm Journal of the ACM 49 (1) 16-34
  • Wikipedia (2020): Minimum Spanning Tree https://en.wikipedia.org/wiki/Minimum_spanning_tree




Author:
Lakshmi Krishnamurthy

  • Method Summary

    Modifier and Type Method Description
    int c()
    Retrieve the Vertex Capacity c to generate the MST for

    Methods inherited from class org.drip.graph.treebuilder.OptimalSpanningForestGenerator

    graph, maximum, optimalSpanningForest

    Methods inherited from class java.lang.Object

    equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

  • Method Details

    • c

      public int c()
      Retrieve the Vertex Capacity c to generate the MST for
      Returns:
      The Vertex Capacity c