Minimum Paths in Directed Graphs
ALAN M. FRIEZE · Journal of the Operational Research Society · 1977
This paper considers the problem of finding paths from a fixed node to all other nodes of a directed graph which minimise a function defined on the paths. Under certain assumptions a characterisation of optimal paths is derived. Two algorithms which are generalisations of standard shortest path methods are then given.