On Mar 2, 11:26 pm, Hyunchul Kim wrote:
> Dear Odeits,
>
> Yes, I meant directly connected to each other.
>
> Thanks.
>
> Hyunchul
>
> odeits wrote:
> > On Mar 2, 10:35 pm, Hyunchul Kim wrote:
>
> >> Hi, all,
>
> >> How can I find all "completely connected subgraphs" in a graph when node
> >> and
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 n
Hi Hyunchul,
On Tue, 03 Mar 2009 15:35:11 +0900, 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.
Since you'
On Mar 3, 12:07 am, Andre Engels wrote:
> On Tue, Mar 3, 2009 at 7:35 AM, Hyunchul Kim wrote:
> > 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 e
On Tue, Mar 3, 2009 at 7:35 AM, Hyunchul Kim wrote:
> 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.
Here is an algorithm I came up with in
Dear Odeits,
Yes, I meant directly connected to each other.
Thanks.
Hyunchul
odeits wrote:
On Mar 2, 10:35 pm, 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,
On Mar 2, 10:35 pm, 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
Do you mean a
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
