Hi, You can call get.all.shortest.paths() from each vertex individually, and then keep the longest ones.
Best, Gabor On Fri, Mar 30, 2012 at 4:10 AM, Delphine Faugaret <[email protected]> wrote: > Hello, > > To get the diameter of my graph I do: > > get.diameter (graph, directed = FALSE, unconnected = TRUE, weights = NULL) > In the help line, it's written: "get.diameter returns a path with the actual > diameter. If there > are many shortest paths of the length of the diameter, then it returns > the first one found." > For it would be relevan to have all the diameter paths, if they exist. What > should I do? > > Thanks, > > Delph > > > _______________________________________________ > igraph-help mailing list > [email protected] > https://lists.nongnu.org/mailman/listinfo/igraph-help > -- Gabor Csardi <[email protected]> MTA KFKI RMKI _______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
