Description Usage Arguments Details Value Author(s) References See Also Examples
Algorithm for the single-source shortest-paths problem on a weighted, directed acyclic graph (DAG)
1 |
g |
instance of class graph |
start |
source node for start of paths |
These functions are interfaces to the Boost graph library C++ routines for single-source shortest-paths on a weighted directed acyclic graph. Choose appropriate shortest-path algorithms carefully based on the properties of the input graph. See documentation in Boost Graph Library for more details.
A list with elements:
distance |
The vector of distances from |
penult |
A vector of indices
(in |
start |
The start node that was supplied in the call to
|
Li Long <li.long@isb-sib.ch>
Boost Graph Library ( www.boost.org/libs/graph/doc/index.html )
The Boost Graph Library: User Guide and Reference Manual; by Jeremy G. Siek, Lie-Quan Lee, and Andrew Lumsdaine; (Addison-Wesley, Pearson Education Inc., 2002), xxiv+321pp. ISBN 0-201-72914-8
bellman.ford.sp
, dijkstra.sp
, johnson.all.pairs.sp
, sp.between
1 2 3 4 5 |
Loading required package: graph
Loading required package: BiocGenerics
Loading required package: parallel
Attaching package: 'BiocGenerics'
The following objects are masked from 'package:parallel':
clusterApply, clusterApplyLB, clusterCall, clusterEvalQ,
clusterExport, clusterMap, parApply, parCapply, parLapply,
parLapplyLB, parRapply, parSapply, parSapplyLB
The following objects are masked from 'package:stats':
IQR, mad, sd, var, xtabs
The following objects are masked from 'package:base':
Filter, Find, Map, Position, Reduce, anyDuplicated, append,
as.data.frame, basename, cbind, colMeans, colSums, colnames,
dirname, do.call, duplicated, eval, evalq, get, grep, grepl,
intersect, is.unsorted, lapply, lengths, mapply, match, mget,
order, paste, pmax, pmax.int, pmin, pmin.int, rank, rbind,
rowMeans, rowSums, rownames, sapply, setdiff, sort, table, tapply,
union, unique, unsplit, which, which.max, which.min
$distance
A B C D E G H F
0 1 1 1 2 2 2 3
$penult
A B C D E G H F
1 1 1 1 3 3 4 5
$start
[1] "A"
$distance
A B C D E G H F
Inf 0 1 1 2 2 2 3
$penult
A B C D E G H F
1 2 2 2 3 3 4 5
$start
[1] "B"
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.