
From:  harun pirim 
Subject:  [igraph] diameter 
Date:  Tue, 17 Aug 2010 17:54:43 0500 
unconnected
Logical, what to do if the graph is unconnected. If
FALSE, the function will return the largest possible diameter which
is the number of vertices.Is this true or it is n1 where n is the number of vertices?[Prev in Thread]  Current Thread  [Next in Thread] 