Optimal Paths
Jean-Claude Fournier · 2009
This chapter contains sections titled: Distances and shortest paths problems Case of non-weighted digraphs: breadth-first search Digraphs without circuits Application to scheduling Positive lengths Other cases Exercises