Namespace Advanced.Algorithms.Graph
Classes
AllPairShortestPathResult<T, W>
All pairs shortest path algorithm result object.
BellmanFordShortestPath<T, W>
A Bellman Ford algorithm implementation.
BiDirectional<T>
A BiDirectional Path Search on DiGraph.
BiPartiteMatching<T>
Compute Max BiParitite Edges using Ford-Fukerson algorithm.
BreadthFirst<T>
Bread First Search implementation.
Bridge<T>
The bridge object.
CycleDetector<T>
Cycle detection using Depth First Search.
DepthFirst<T>
Depth First Search.
DepthFirstTopSort<T>
Find Toplogical order of a graph using Depth First Search.
DijikstraShortestPath<T, W>
A dijikstra algorithm implementation using Fibornacci Heap.
EdmondKarpMaxFlow<T, W>
An Edmond Karp max flow implementation on weighted directed graph using adjacency list representation of graph and residual graph.
FloydWarshallShortestPath<T, W>
A floyd-warshall shortest path algorithm implementation.
FordFulkersonMaxFlow<T, W>
A ford-fulkerson max flox implementation on weighted directed graph using adjacency list representation of graph and residual graph.
HopcroftKarpMatching<T>
Compute Max BiParitite Edges using Hopcroft Karp algorithm.
JohnsonsShortestPath<T, W>
A Johnson's shortest path algorithm implementation.
KahnsTopSort<T>
Find Toplogical order of a graph using Kahn's algorithm.
KosarajuStronglyConnected<T>
A Kosaraju Strong Connected Component Algorithm Implementation.
Kruskals<T, TW>
A Kruskal's alogorithm implementation using merge sort and disjoint set.
MatchEdge<T>
The match result object.
MColorer<T, C>
An m-coloring algorithm implementation.
MColorResult<T, C>
M-coloring result object.
MinCut<T, W>
Compute minimum cut edges of given graph using Edmond Karps improved Ford-Fulkerson Max Flow Algorithm.
MinCutEdge<T>
Minimum cut result object.
MinVertexCover<T>
A minimum vertex conver algorithm implementation.
MSTEdge<T, W>
Minimum spanning tree edge object.
Prims<T, W>
A Prims algorithm implementation.
PushRelabelMaxFlow<T, W>
A Push-Relabel algorithm implementation.
ShortestPathResult<T, W>
Shortest path result object.
TarjansArticulationFinder<T>
Articulation point finder using Tarjan's algorithm.
TarjansBiConnected<T>
Finds if a graph is BiConnected.
TarjansBridgeFinder<T>
Bridge finder using Tarjan's algorithm.
TarjansStronglyConnected<T>
Strongly connected using Tarjan's algorithm.
TravellingSalesman
Uses dynamic programming for a psuedo-polynomial time runTime complexity for this NP hard problem.
Interfaces
IBiPartiteMatchOperators<T>
Generic operator interface required by BiPartite matching algorithm.
IFlowOperators<W>
Operators to deal with generic Add, Substract etc on edge weights for flow algorithms such as ford-fulkerson algorithm.
IJohnsonsShortestPathOperators<T, W>
A concrete implementation of this interface is required by Johnson's algorithm.
IShortestPathOperators<W>
Generic operators interface required by shorted path algorithms.