getBins: Bins for the node distance distribution (NDD)
In cds-group/GraphDistances: Distribution based distance computation between graphs
Description
Usage
Arguments
Value
Author(s)
Examples
View source: R/distributionComp.R
Description
getBins finds the maximum diameter from the given graph list and returns the
bins needed for the getNodeDistanceDistr function
Usage
1
Arguments
gList
List of graphs in igraph format
Value
binList
Author(s)
Ichcha Manipur & Mario R Guarracino
Examples
1
2
3
4
## Not run:
data(KidneyGraphs)
binsG <- getBins(KidneyGraphs)
## End(Not run)
cds-group/GraphDistances documentation built on Dec. 14, 2020, 8:26 a.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 Value Author(s) Examples
View source: R/distributionComp.R
Description
getBins finds the maximum diameter from the given graph list and returns the bins needed for the getNodeDistanceDistr function
Usage
1 |
Arguments
gList |
List of graphs in igraph format |
Value
binList
Author(s)
Ichcha Manipur & Mario R Guarracino
Examples
1 2 3 4 | ## Not run:
data(KidneyGraphs)
binsG <- getBins(KidneyGraphs)
## End(Not run)
|
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.