Description: plans for the vertex connectivity algorithms. First is the method of sources and sinks so enumerated, after the enumeration of each, two sources and sinks to remove all remaining vertices as capacity constraints to a point, seeking the largest network flow, this is the apex of connectivity, followed by enumeration of all points of connectivity for the smallest of the plan as connectivity. Vertex capacity constraints with the biggest flow method : with the capacity constraints of the vertex is split into two u u and u*, the original entry point u u edge of the income side, the original point out u* u edge of the edge out after the u and u* a two-way link between the edge, while the capacity for the top point of the capacity constraints.
File list (Check if you may need any files):
Download