08/08/2011 update: Version 1.1.4 uploaded.
 New algorithms:
 FloydWarshall allpairs shortestpath algorithm for dense networks. Currently the algorithm is set to automatically kickin when density (E/V^2 with undirected edges treated as two directed edges) is >0.75 for unweighted networks and >0.5 for weighted networks.
 EdmondsKarp algorithm for solving maximum flow problem. Sets of source and sink vertices of minimum cut are found using breadthfirst search on residual capacity matrix.
 Documentation and examples:
 Section 5: Maxflow mincut added.
 Section 9.5: Maxflow mincut example added.
 Syntax: network..., ...measure(maxflow) source(string) sink(string) [residual mincut]
 Vertex names for source() and sink() should be enclosed in double quotes, even if the names are numeric.
 By default, if residual and mincut are not specified, flow matrix is returned. Only one of residual or mincut can be specified at one time.

Updating...
SGL_version_1.1.4.zip (918k) Hirotaka Miura, Aug 8, 2011, 7:19 PM
