Weakly Connected Components is useful for finding the individual components that are in any given graph.
As you can see from the image above, that graph has 3 Weakly Connected Components.
As the name suggests, Weakly Connected Components needs to be undirected to work properly. However, you can run Weakly Connected Components with a directional graph. Your results might varry from the undirected version.
For an edge list:
A,B B,C D,C E,H
The output will be as follows:
A,B,D B,C,D D,C,D E,H,H
The third column represents the component each edge belongs to, which is the highest ascii value in the component.
|There are no configuration options.|
Note: First see How To Build
$ ./bin/dga-giraph wcc /path/to/input /path/to/output
$ ./dga-graphx wcc -i hdfs://url.for.namenode:port/path/to/input -o hdfs://url.for.namenode:port/path/to/output