bellman.ford.sp {RBGL} | R Documentation |
Algorithm for the single-source shortest paths problem for a graph with both positive and negative edge weights.
bellman.ford.sp(g,start=nodes(g)[1])
g |
instance of class graph |
start |
character: node name for start of path |
This function interfaces to the Boost graph library C++ routines for Bellman-Ford shortest paths. Choose the appropriate algorithm to calculate the shortest path carefully based on the properties of the given graph. See documentation on Bellman-Ford algorithm in Boost Graph Library for more details.
A list with elements:
all edges minimized |
true if all edges are minimized, false otherwise. |
distance |
The vector of distances from start to each node
of g ; includes Inf when there is no path from start . |
penult |
A vector of indices
(in nodes(g) ) of predecessors corresponding to each node
on the path from that node back to start |
start |
The start node that was supplied in the call to
bellman.ford.sp . |
Li Long <li.long@isb-sib.ch>
dag.sp
, dijkstra.sp
, johnson.all.pairs.sp
, sp.between
dd <- fromGXL(file(system.file("XML/conn2.gxl",package="RBGL"))) bellman.ford.sp(dd) bellman.ford.sp(dd,nodes(dd)[2])