Package org.drip.graph.core

Class CompleteBipartite<V>

java.lang.Object

org.drip.graph.core.Network<V>

org.drip.graph.core.Directed<V>

org.drip.graph.core.CompleteBipartite<V>

public class CompleteBipartite<V>
extends Directed<V>

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 Cycle
java.util.Map<java.lang.String,Edge>	crossConnectMap()	Retrieve the Cross Connection Edge Map
boolean	isComplete()	Indicate if the Graph is Complete
boolean	isConnected()	Indicate if the Graph is Connected
boolean	isTree()	Indicate if the Graph is a Tree
int	p()	Retrieve P
int	q()	Retrieve Q
double	spanningTreeCount()	Retrieve the Count of the Spanning Trees
int	type()	Retrieve the Graph Type
java.util.Set<java.lang.String>	vertexNameSetP()	Retrieve the P Vertex Name Set
java.util.Set<java.lang.String>	vertexNameSetQ()	Retrieve the Q Vertex Name Set

Methods inherited from class org.drip.graph.core.Directed

addGraph, areVertexesAdjacent, clone, fundamentalCycleEdgeSet, isCyclical, isDense, isTreeSpanning, kirchoffSpanningTreeCount, leafVertexNameList, Transpose, vertexDegreeMap

Methods inherited from class org.drip.graph.core.Network

addBidirectionalEdge, addBidirectionalEdge, addEdge, addEdge, addVertex, addVertex, containsEdge, containsVertex, edgeCount, edgeMap, edgePriorityQueue, initialVertexName, isEdgeACycle, isEmpty, length, removeEdge, vertexCount, vertexMap, vertexNameSet, vertexValue

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.Exception

CompleteBipartite Constructor

Parameters:

vertexNameSetP - P Vertex Name Set

vertexNameSetQ - Q Vertex Name Set

crossConnectMap - 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

public java.util.Map<java.lang.String,Edge> 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: Directed

Indicate if the Graph is Connected

Overrides:

isConnected in class Directed<V>

Returns:

TRUE - The Graph is Connected

isTree

public boolean isTree()

Description copied from class: Directed

Indicate if the Graph is a Tree

Overrides:

isTree in class Directed<V>

Returns:

TRUE - The Graph is a Tree

isComplete

public boolean isComplete()

Description copied from class: Directed

Indicate if the Graph is Complete

Overrides:

isComplete in class Directed<V>

Returns:

TRUE - The Graph is Complete

containsCycle

public boolean containsCycle()

Description copied from class: Directed

Indicate if the Graph contains a Cycle

Overrides:

containsCycle in class Directed<V>

Returns:

TRUE - The Graph contains a Cycle

type

public int type()

Description copied from class: Directed

Retrieve the Graph Type

Overrides:

type in class Directed<V>

Returns:

The Graph Type

spanningTreeCount

public double spanningTreeCount()

Description copied from class: Directed

Retrieve the Count of the Spanning Trees

Overrides:

spanningTreeCount in class Directed<V>

Returns:

Count of the Spanning Trees