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




Author:
Lakshmi Krishnamurthy
  • 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

      public boolean absorbTreeAndEdge​(Tree tree, Edge edge)
      Absorb the Specified Tree and Edge
      Parameters:
      tree - The Tree
      edge - 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 Graph
      minHeap - TRUE - The Edge Priority Queue is in the Descending Order of Distance
      Returns:
      The Tree Adjacency Map
    • maximumBottleneckEdge

      public Edge maximumBottleneckEdge()
      Retrieve the Maximum Bottleneck Edge of the Tree
      Returns:
      The Maximum Bottleneck Edge of the Tree
    • minimumBottleneckEdge

      public Edge minimumBottleneckEdge()
      Retrieve the Minimum Bottleneck Edge of the Tree
      Returns:
      The Minimum Bottleneck Edge of the Tree