For shortest paths look at the Wikipedia page of the Floyd–Warshall algorithm
and also:
"An algorithm for computing all paths in a graph" by Lars-Erik Thorelli in BIT Numerical Mathematics, July 1966, Volume 6, Issue 4, pp 347-349
3 of 3
added title and author information to (non-wikipedia) linked article
Joseph Malkevitch
- 1.7k
- 1
- 12
- 13