Package org.drip.graph.bellmanford

Class EdgePartition<V>

java.lang.Object

org.drip.graph.bellmanford.EdgePartition<V>

public class EdgePartition<V>
extends java.lang.Object

EdgePartition contains the sub-graphs of the Partitioned Vertexes and their Edges from a Master Graph. The References are:

• Bang-Jensen, J., and G. Gutin (2008): Digraphs: Theory, Algorithms, and Applications 2^nd Edition Springer
• Cormen, T., C. E. Leiserson, R. Rivest, and C. Stein (2009): Introduction to Algorithms 3^rd Edition MIT Press
• Kleinberg, J., and E. Tardos (2022): Algorithm Design 2^nd Edition Pearson
• Sedgewick, R. and K. Wayne (2011): Algorithms 4^th Edition Addison Wesley
• Wikipedia (2020): Bellman-Ford Algorithm https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm

• Module = Computational Core Module
• Library = Graph Algorithm Library
• Project = Graph Optimization and Tree Construction Algorithms
• Package = Bellman Ford Shortest Path Family

Author:

Lakshmi Krishnamurthy

Constructor Summary

Constructors

Constructor	Description
EdgePartition(java.util.Map<java.lang.String,java.lang.Integer> vertexIndexMap, java.util.List<java.lang.String> vertexNameList, Directed<?> forwardDirectedGraph, Directed<?> backwardDirectedGraph)	EdgePartition Constructor

Method Summary

Modifier and Type	Method	Description
Directed<?>	backwardDirectedGraph()	Retrieve the Backward Directed Graph
Directed<?>	forwardDirectedGraph()	Retrieve the Forward Directed Graph
static <V> EdgePartition<?>	FromGraph(Directed<?> graph, boolean randomizeVertexes)	Generate the EdgePartition from a Graph
java.util.Map<java.lang.String,java.lang.Integer>	vertexIndexMap()	Retrieve the Vertex Index Map
java.util.List<java.lang.String>	vertexNameList()	Retrieve the Vertex Name List

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

EdgePartition

public EdgePartition(java.util.Map<java.lang.String,java.lang.Integer> vertexIndexMap,
java.util.List<java.lang.String> vertexNameList,
Directed<?> forwardDirectedGraph,
Directed<?> backwardDirectedGraph)
              throws java.lang.Exception

EdgePartition Constructor

Parameters:

vertexIndexMap - The Vertex Index Map

vertexNameList - The Vertex Name List

forwardDirectedGraph - The Forward Directed Graph

backwardDirectedGraph - The Backward Directed Graph

Throws:

java.lang.Exception - Thrown if the Inputs are Invalid

Method Details

FromGraph

public static <V> EdgePartition<?> FromGraph(Directed<?> graph,
boolean randomizeVertexes)

Generate the EdgePartition from a Graph

Parameters:

graph - The Graph

randomizeVertexes - Randomize the Graph Vertexes

Returns:

EdgePartition from a Graph

vertexIndexMap

public java.util.Map<java.lang.String,java.lang.Integer> vertexIndexMap()

Retrieve the Vertex Index Map

Returns:

The Vertex Index Map

vertexNameList

public java.util.List<java.lang.String> vertexNameList()

Retrieve the Vertex Name List

Returns:

The Vertex Name List

forwardDirectedGraph

public Directed<?> forwardDirectedGraph()

Retrieve the Forward Directed Graph

Returns:

The Forward Directed Graph

backwardDirectedGraph

public Directed<?> backwardDirectedGraph()

Retrieve the Backward Directed Graph

Returns:

The Backward Directed Graph