randomGraph: Random Graph Generation
In huoston/shortestpath: Shortest Path Algorithm Visualization
Description
Usage
Arguments
See Also
Description
This method generates a random graph with the given number of nodes and average connectivity.
The result is a graph that is neither too uniform nor too degenerated and suitable for exercises.
Usage
1
randomGraph(no.of.nodes = 12, k = 2.5, euclidean = FALSE)
Arguments
no.of.nodes
Integer scalar, the number of vertices in the generated
graph.
k
The average degree of each vertex in the graph
euclidean
Set to TRUE if (rounded) euclidean distances should be used.
See Also
removeIntersectingEdges to remove intersecting edges.
huoston/shortestpath documentation built on May 25, 2019, 8:18 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 See Also
Description
This method generates a random graph with the given number of nodes and average connectivity. The result is a graph that is neither too uniform nor too degenerated and suitable for exercises.
Usage
1 | randomGraph(no.of.nodes = 12, k = 2.5, euclidean = FALSE)
|
Arguments
no.of.nodes |
Integer scalar, the number of vertices in the generated graph. |
k |
The average degree of each vertex in the graph |
euclidean |
Set to |
See Also
removeIntersectingEdges to remove intersecting edges.
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.