Algorithms
Here we will provide a list of available algorithms implemented into spargel:
- AllPairsShortestPath
Floyd-Warshall-Algorithm
- CentralPoints
Computes the central points out of an all-pairs-shortest-path-solution.
- SingleSourceShortestPath
Dijkstra's Algorithm
- MaxFlow
Ford-Fulkerson-Algorithm
- STMinCut
Uses the Max-Flow-Min-Cut-Theorem
- MinCut
For computing the global minimum cut using the Stoer-Wagner-Algorithm
- ConnectedComponents
Computes the connected components using a depth-first-search. Algorithm was well known, firtly described by Hopcroft and Tarjan.
- StronglyConnectedComponents
Uses Tarjan's Algorithm
- BiconnectedComponents
Computes the biconnected sub-graphs described by Hopcroft and Tarjan.