https://sourceforge.net/p/spargel/wiki/algorithms/Recent changes to algorithmsenWed, 03 Apr 2013 17:54:42 -0000https://sourceforge.net/p/spargel/wiki/algorithms/<div class="markdown_content"><h1 id="algorithms">Algorithms</h1> <p>Here we will provide a list of available algorithms implemented into spargel:</p> <ul> <li><strong>AllPairsShortestPath</strong><br /> <em>Floyd-Warshall-Algorithm</em></li> <li><strong>CentralPoints</strong><br /> Computes the central points out of an all-pairs-shortest-path-solution.</li> <li><strong>SingleSourceShortestPath</strong><br /> <em>Dijkstra's Algorithm</em></li> <li><strong>MaxFlow</strong><br /> <em>Ford-Fulkerson-Algorithm</em></li> <li><strong>STMinCut</strong><br /> Uses the <em>Max-Flow-Min-Cut-Theorem</em></li> <li><strong>MinCut</strong><br /> For computing the global minimum cut using the <em>Stoer-Wagner-Algorithm</em></li> <li><strong>ConnectedComponents</strong><br /> Computes the connected components using a depth-first-search. Algorithm was well known, firtly described by Hopcroft and Tarjan.</li> <li><strong>StronglyConnectedComponents</strong><br /> Uses Tarjan's Algorithm</li> <li><strong>BiconnectedComponents</strong><br /> Computes the biconnected sub-graphs described by Hopcroft and Tarjan.</li> </ul></div>Philipp HülsdunkWed, 03 Apr 2013 17:54:42 -0000https://sourceforge.net3257f5413dba7c9c03b3c52fa122320efe56181a