#163 Enhancement: Strong connected subgraph impl. (ready for use)

[Philipp Förmer]

Hi,

I was searching for an implementation to compute the strong and weak connected subgraphs of a graph in JUNG 2. I only found an algorithm to compute the subgraphs of an undirected graph (possibly I am blind). I wrote an implementation to compute the strong and weak connected subgraphs by using the algorithm of B. Tarjan (1972) (see attached zip file which contains bin/source/javadoc jar archives),
You can do whatever you want with the code (MIT license) and will be glad to see it anytime in JUNG.
I hope this is the right place for a post like this.

Best regards,
Philipp Förmer

[Philipp Förmer]

Strong/weak connected subgraph implementation

[Philipp Förmer]

Test sources

[Philipp Förmer]

Forget the test sources, sorry.