|
From: | ???????????? |
Subject: | [igraph] ?????? ?????? how to find disconn ected components |
Date: | Fri, 21 Jun 2013 14:05:15 +0800 |
>>> from igraph import Graph >>> g = Graph.Ring(20) >>> mc = g.mincut() >>> print mc.value 2.0 >>> print min(map(len, mc)) 1 >>> mc.es["color"] = "red"
Hi Gabor,i'm not sure whether clusters() is my want.
i try to make it more clear:g1 and g2 are two connected graphs, and i also can put them together as G, which contains 2 disconnected components.in addition, in g1 and g2, several connecting components may be found by some functions.what i want is to return 2 but not more disconnected components.Gang------------------ ???????? ------------------??????: "G??bor Cs??r"<address@hidden>;????????: 2013??6??21??(??????) ????1:25??????: "Help for igraph users"<address@hidden>;????: Re: [igraph] how to find disconnected componentsI am not sure that I get what you want, but isn't just clusters() what you are looking for? If not, then can you give an example?GaborOn Fri, Jun 21, 2013 at 1:22 AM, ???????????? <address@hidden> wrote:Hi all,for a disconnected graph, how to find all the disconnected components, pls?i checked the functions about components and blocks, but i'm afraid of returning connected components as well.Thanks.Gang
_______________________________________________
igraph-help mailing list
address@hidden
https://lists.nongnu.org/mailman/listinfo/igraph-help
_______________________________________________
igraph-help mailing list
address@hidden
https://lists.nongnu.org/mailman/listinfo/igraph-help
[Prev in Thread] | Current Thread | [Next in Thread] |