how to find all completely connected sub-graphs?

andrew cooke andrew at acooke.org
Tue Mar 3 10:20:36 CET 2009


if you mean "strongly connected components" then see
http://en.wikipedia.org/wiki/Strongly_connected_component.  there is no
need to invent a solution; standard methods already exist.

andrew


Hyunchul Kim wrote:
> Hi, all,
>
> How can I find all "completely connected subgraphs" in a graph when node
> and edge data are available?
>
> "completely connected subgraph" is a group, all members of which are
> connected to each other.
>
> Thanks,
>
> Hyunchul
>
>
> --
> http://mail.python.org/mailman/listinfo/python-list
>
>





More information about the Python-list mailing list