Package org.drip.graph.core

Vertexes, Edges, Trees, and Graphs
Author:
Lakshmi Krishnamurthy
  • Class Summary
    Class Description
    CompleteBipartite<V>
    CompleteBipartite implements a Complete, Bipartite Graph.
    Directed<V>
    Directed implements the Vertex/Edge Topology corresponding to a Directed Graph.
    DirectedType
    DirectedType holds the Pre-specified Directed Graph Types.
    Edge
    Edge represents the Connection between a Pair of Vertexes.
    Forest<V>
    Forest holds a Map of Trees indexed by the Starting Vertex Names.
    NDimensionalHypercube<V>
    NDimensionalHypercube implements an n-dimensional Hyper-cube Graph.
    Network<V>
    Network implements a Generic Topological Network containing Discrete Vertexes and Edges.
    Path
    Path contains a contiguous Series of Edges representing a Path from a Source to a Destination.
    Tree<V>
    Tree holds the Vertexes and the Edges associated with a Tree.
    Vertex<V>
    Vertex implements a Single Vertex Node and the corresponding Egresses emanating from it.