[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] How to find latgest connected component in graph
|
From: |
Jan Eberhardt |
|
Subject: |
Re: [igraph] How to find latgest connected component in graph |
|
Date: |
Wed, 13 Jan 2016 16:02:03 +0000 |
|
User-agent: |
Horde Application Framework 5 |
Zitat von Saeed Rahmani <address@hidden>:
Hi All,
I need largest connected component in graph, I use of "components"
function but this result not is graph, I need a result in graph
object of igraph.!
In Python you would do:
g = igraph.Graph.Erdos_Renyi(300, m=600)
cl = g.clusters()
lcc = cl.giant()
Thats it.
Kind regards
Jan