PURPOSE Compute the local point connectivity between all pairs of nodes in a network.
DESCRIPTION The local (point) connectivity of two non-adjacent vertices is the number of vertices that need to be deleted so that no path connects them, this is equal to the maximum number of vertex disjoint paths connecting them.
Name of file containing network to be analyzed. Data type: Digraph
Output Filename (Default = 'PointConnectivity').
Name of data file containing maximum flows between all pairs of vertices.
LOG FILE An nxn matrix in which row i column j gives the local point connectivity from vertex i to vertex j (i ¹ j). This value is precisely the maximum number of vertex independent paths from i to j.