Package org.drip.graph.core
Class NDimensionalHypercube
java.lang.Object
org.drip.graph.core.Network
org.drip.graph.core.DirectedGraph
org.drip.graph.core.NDimensionalHypercube
public class NDimensionalHypercube extends DirectedGraph
NDimensionalHypercube implements an n-dimensional Hyper-cube Graph. 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 NDimensionalHypercube()
NDimensionalHypercube Constructor -
Method Summary
Modifier and Type Method Description boolean
containsCycle()
Indicate if the Graph contains a Cycleboolean
isComplete()
Indicate if the Graph is Completeboolean
isConnected()
Indicate if the Graph is Connectedboolean
isTree()
Indicate if the Graph is a Treedouble
spanningTreeCount()
Retrieve the Count of the Spanning Treesint
type()
Retrieve the Graph TypeMethods inherited from class org.drip.graph.core.DirectedGraph
addGraph, areVertexesAdjacent, clone, fundamentalCycleEdgeSet, isCyclical, isDense, isTreeSpanning, kirchoffSpanningTreeCount, leafVertexNameList, Transpose, vertexDegreeMap
Methods 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
-
NDimensionalHypercube
public NDimensionalHypercube()NDimensionalHypercube Constructor
-
-
Method Details
-
isConnected
public boolean isConnected()Description copied from class:DirectedGraph
Indicate if the Graph is Connected- Overrides:
isConnected
in classDirectedGraph
- Returns:
- TRUE - The Graph is Connected
-
isTree
public boolean isTree()Description copied from class:DirectedGraph
Indicate if the Graph is a Tree- Overrides:
isTree
in classDirectedGraph
- Returns:
- TRUE - The Graph is a Tree
-
isComplete
public boolean isComplete()Description copied from class:DirectedGraph
Indicate if the Graph is Complete- Overrides:
isComplete
in classDirectedGraph
- Returns:
- TRUE - The Graph is Complete
-
containsCycle
public boolean containsCycle()Description copied from class:DirectedGraph
Indicate if the Graph contains a Cycle- Overrides:
containsCycle
in classDirectedGraph
- Returns:
- TRUE - The Graph contains a Cycle
-
type
public int type()Description copied from class:DirectedGraph
Retrieve the Graph Type- Overrides:
type
in classDirectedGraph
- Returns:
- The Graph Type
-
spanningTreeCount
public double spanningTreeCount()Description copied from class:DirectedGraph
Retrieve the Count of the Spanning Trees- Overrides:
spanningTreeCount
in classDirectedGraph
- Returns:
- Count of the Spanning Trees
-