DESCRIPTION computes the weakly and strongly connected components in a network.


Two nodes, u and v are in the same strongly connected component if there are directed paths from u to v and from v to u. The nodes are in the same weakly connected component if, ignoring orientation of the edges, there is a path between them.
The type of components is specified by method parameter. Module creates a table and links it to the given layer. This table contains only two integer columns: cat and comp. If a point or both endpoints of a line belong to the same component then the point/line is written to the output map and appropriate information is stored in the table. If -a flag is set then new points are added on the nodes without points. These points have category numbers larger than any category used in the input map.


Any road network should form a single strongly connected components. Otherwise, it is impossible to travel between some places. input=roads output=roads_components method=strong




Daniel Bundala, Google Summer of Code 2009, Student
Wolf Bergenheim, Mentor

Last changed: $Date$