compGdist {GOstats} | R Documentation |
Given a graph, g
, and a set of nodes in the graph,
whNodes
, Dijkstra's shortest path algorithm is used to compute
the distance between all pairs of nodes in whNodes
.
compGdist(g, whNodes, verbose = FALSE)
g |
An instance of the graph class. |
whNodes |
A vector of lables of the nodes in g for which
distances are to be computed. |
verbose |
If TRUE then output reporting the progress will
be reported. |
This function can be quite slow, computation of the pairwise
distances is not especially fast and if whNodes
is long then
there are many of them to compute.
A matrix containing the pairwise distances. It might be worth making
this an instance of the dist
class at some point.
R. Gentleman
example(compCorrGraph) compGdist(corrG, nodes(corrG)[1:5])