Package org.drip.graph.mstgreedy

Class KruskalGenerator<V>

java.lang.Object
org.drip.graph.treebuilder.OptimalSpanningForestGenerator
org.drip.graph.mstgreedy.KruskalGenerator<V>
public class KruskalGenerator<V>
extends OptimalSpanningForestGenerator
KruskalGenerator implements the Kruskal Algorithm for generating a Minimum Spanning Tree. The References are:

  • Cormen, T., C. E. Leiserson, R. Rivest, and C. Stein (2009): Introduction to Algorithms 3rd Edition MIT Press
  • Grama, A., A. Gupta, G. Karypis, and V. Kumar (2003): Introduction to Parallel Computing 2nd Edition Addison Wesley
  • Osipov, V., P. Sanders, and J. Singler (2009): The Filter-Kruskal Minimum Spanning Tree Algorithm http://algo2.iti.kit.edu/documents/fkruskal.pdf
  • Quinn, M. J., and N. Deo (1984): Parallel Graph Algorithms ACM Computing Surveys 16 (3) 319-348
  • Wikipedia (2019): Kruskal's Algorithm https://en.wikipedia.org/wiki/Kruskal%27s_algorithm




Author:
Lakshmi Krishnamurthy

  • Constructor Summary

    Constructors
    Constructor Description
    KruskalGenerator​(Directed<?> graph, boolean maximum)
    KruskalGenerator Constructor

  • Method Summary

    Modifier and Type Method Description
    Forest<?> optimalSpanningForest()
    Generate the Optimal Spanning Forest

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

    graph, maximum

    Methods inherited from class java.lang.Object

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

  • Constructor Details

    • KruskalGenerator

      public KruskalGenerator​(Directed<?> graph, boolean maximum) throws java.lang.Exception
      KruskalGenerator Constructor
      Parameters:
      graph - The Graph
      maximum - TRUE - The Maximum Spanning Forest is to be generated
      Throws:
      java.lang.Exception - Thrown if the Inputs are Invalid

  • Method Details