Package org.drip.graph.core
Class CompleteBipartite
java.lang.Object
org.drip.graph.core.Network
org.drip.graph.core.DirectedGraph
org.drip.graph.core.CompleteBipartite
public class CompleteBipartite extends DirectedGraph
CompleteBipartite implements a Complete, Bipartite 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 CompleteBipartite(java.util.Set<java.lang.String> vertexNameSetP, java.util.Set<java.lang.String> vertexNameSetQ, java.util.Map<java.lang.String,Edge> crossConnectMap)
CompleteBipartite Constructor -
Method Summary
Modifier and Type Method Description boolean
containsCycle()
Indicate if the Graph contains a Cyclejava.util.Map<java.lang.String,Edge>
crossConnectMap()
Retrieve the Cross Connection Edge Mapboolean
isComplete()
Indicate if the Graph is Completeboolean
isConnected()
Indicate if the Graph is Connectedboolean
isTree()
Indicate if the Graph is a Treeint
p()
Retrieve Pint
q()
Retrieve Qdouble
spanningTreeCount()
Retrieve the Count of the Spanning Treesint
type()
Retrieve the Graph Typejava.util.Set<java.lang.String>
vertexNameSetP()
Retrieve the P Vertex Name Setjava.util.Set<java.lang.String>
vertexNameSetQ()
Retrieve the Q Vertex Name SetMethods 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
-
CompleteBipartite
public CompleteBipartite(java.util.Set<java.lang.String> vertexNameSetP, java.util.Set<java.lang.String> vertexNameSetQ, java.util.Map<java.lang.String,Edge> crossConnectMap) throws java.lang.ExceptionCompleteBipartite Constructor- Parameters:
vertexNameSetP
- P Vertex Name SetvertexNameSetQ
- Q Vertex Name SetcrossConnectMap
- Cross Connection Map- Throws:
java.lang.Exception
- Thrown if the Inputs are Invalid
-
-
Method Details
-
vertexNameSetP
public java.util.Set<java.lang.String> vertexNameSetP()Retrieve the P Vertex Name Set- Returns:
- The P Vertex Name Set
-
vertexNameSetQ
public java.util.Set<java.lang.String> vertexNameSetQ()Retrieve the Q Vertex Name Set- Returns:
- The Q Vertex Name Set
-
crossConnectMap
Retrieve the Cross Connection Edge Map- Returns:
- The Cross Connection Edge Map
-
p
public int p()Retrieve P- Returns:
- P
-
q
public int q()Retrieve Q- Returns:
- Q
-
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
-