In a weighted (di)graph, find shortest paths between every pair of vertices.
How many nodes are in your graph?:
2
2
3
4
5
6
7
8
9