Dear all,
The function description of shortest.paths() indicates:
The implemented algorithms are breadth-first search
(‘unweighted’), this only works for unweighted graphs; the Dijkstra
algorithm (‘dijkstra’), this works for graphs with non-negative
edge weights; the Bellman-Ford algorithm (‘bellman-ford’), and
Johnson's algorithm (‘"johnson"’). The latter two algorithms work
with arbitrary edge weights, but (naturally) only for graphs that don't have a
negative cycle.
Short of having access to the referenced book (West, D.B. (1996). Introduction to Graph Theory. Upper Saddle River,
N.J.: Prentice Hall), would you know a reference to what exactly do the algorithms do? Many thanks.