Package org.drip.graph.mstgreedy

Class KruskalForest<V>

java.lang.Object

org.drip.graph.core.Forest<V>

org.drip.graph.mstgreedy.KruskalForest<V>

Direct Known Subclasses:

BoruvkaForest

public class KruskalForest<V>
extends Forest<V>

KruskalForest implements the Extensions to a Forest required by the Kruskal MSF Generator. The References are:

• Bollobas, B. (1998): Modern Graph Theory Springer
• Eppstein, D. (1999): Spanning Trees and Spanners https://www.ics.uci.edu/~eppstein/pubs/Epp-TR-96-16.pdf
• Gross, J. L., and J. Yellen (2005): Graph Theory and its Applications Springer
• Kocay, W., and D. L. Kreher (2004): Graphs, Algorithms, and Optimizations CRC Press
• Wikipedia (2020): Spanning Tree https://en.wikipedia.org/wiki/Spanning_tree

• Module = Computational Core Module
• Library = Graph Algorithm Library
• Project = Graph Optimization and Tree Construction Algorithms
• Package = Greedy Algorithms for MSTs and Forests

Author:

Lakshmi Krishnamurthy

Constructor Summary

Constructors

Constructor	Description
KruskalForest()	KruskalForest Constructor

Method Summary

Methods inherited from class org.drip.graph.core.Forest

addTree, conditionalMerge, containingTree, containingTreeNameMap, containsVertex, length, treeMap, treeNameSet, unitVertexTree, vertexSet

Methods inherited from class java.lang.Object

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

Constructor Details

KruskalForest

public KruskalForest()

KruskalForest Constructor