| fg.diameter | R Documentation |
Estimate the diameter of a graph, the longest distance between two vertices in a graph.
fg.diameter(graph, directed = FALSE)
graph |
The FlashGraph object |
directed |
Indicates whether or not to respect the direction of edges in a graph when traversing the graph. It is ignored for undirected graphs. |
This implementation uses the double sweep method described in the paper below to estimate the lower bound of the diameter.
Cl茅mence Magnienand Matthieu Latapy and Michel Habib: Fast computation of empirically tight bounds for the diameter of massive graphs, Journal of Experimental Algorithmics (JEA), 2009
A single number
Da Zheng <dzheng5@jhu.edu>
Cl茅mence Magnienand Matthieu Latapy and Michel Habib: Fast computation of empirically tight bounds for the diameter of massive graphs, Journal of Experimental Algorithmics (JEA), 2009