Package org.drip.graph.core
Class Tree
java.lang.Object
org.drip.graph.core.Network
org.drip.graph.core.Tree
public class Tree extends Network
Tree holds the Vertexes and the Edges associated with a Tree. 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 = Vertexes, Edges, Trees, and Graphs
- Author:
- Lakshmi Krishnamurthy
-
Constructor Summary
Constructors Constructor Description Tree()
Tree Constructor -
Method Summary
Modifier and Type Method Description boolean
absorbTreeAndEdge(Tree tree, Edge edge)
Absorb the Specified Tree and Edgeboolean
addStandaloneVertex(java.lang.String vertexName)
Add a Stand-alone Vertex to the NetworkPriorityQueue<java.lang.Double,Edge>
edgePriorityQueue(DirectedGraph graph, boolean minHeap)
Construct and Retrieve the Edge Priority Queue from the GraphEdge
maximumBottleneckEdge()
Retrieve the Maximum Bottleneck Edge of the TreeEdge
minimumBottleneckEdge()
Retrieve the Minimum Bottleneck Edge of the TreeMethods inherited from class org.drip.graph.core.Network
addBidirectionalEdge, addEdge, addVertex, containsEdge, containsVertex, edgeCount, edgeMap, edgePriorityQueue, initialVertexName, isEdgeACycle, isEmpty, length, removeEdge, vertexCount, vertexMap, vertexNameSet
Methods inherited from class java.lang.Object
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
-
Constructor Details
-
Tree
public Tree()Tree Constructor
-
-
Method Details
-
addStandaloneVertex
public boolean addStandaloneVertex(java.lang.String vertexName)Add a Stand-alone Vertex to the Network- Parameters:
vertexName
- The Stand-alone Vertex Name- Returns:
- TRUE - The Stand-alone Vertex successfully added to the Network
-
absorbTreeAndEdge
Absorb the Specified Tree and Edge- Parameters:
tree
- The Treeedge
- The Edge- Returns:
- TRUE - The Tree and Edge successfully absorbed
-
edgePriorityQueue
public PriorityQueue<java.lang.Double,Edge> edgePriorityQueue(DirectedGraph graph, boolean minHeap)Construct and Retrieve the Edge Priority Queue from the Graph- Parameters:
graph
- The GraphminHeap
- TRUE - The Edge Priority Queue is in the Descending Order of Distance- Returns:
- The Tree Adjacency Map
-
maximumBottleneckEdge
Retrieve the Maximum Bottleneck Edge of the Tree- Returns:
- The Maximum Bottleneck Edge of the Tree
-
minimumBottleneckEdge
Retrieve the Minimum Bottleneck Edge of the Tree- Returns:
- The Minimum Bottleneck Edge of the Tree
-