fg.diameter: Diameter estimation
In flashxio/FlashGraphR: Massive Graph Analysis
Description
Usage
Arguments
Details
Value
Author(s)
References
Description
Estimate the diameter of a graph, the longest distance between two vertices
in a graph.
Usage
1
fg.diameter(graph, directed = FALSE)
Arguments
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.
Details
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
Value
A single number
Author(s)
Da Zheng <dzheng5@jhu.edu>
References
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
flashxio/FlashGraphR documentation built on May 8, 2019, 11:11 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Arguments Details Value Author(s) References
Description
Estimate the diameter of a graph, the longest distance between two vertices in a graph.
Usage
1 | fg.diameter(graph, directed = FALSE)
|
Arguments
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. |
Details
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
Value
A single number
Author(s)
Da Zheng <dzheng5@jhu.edu>
References
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
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.