有向グラフの最短路問題：頂点数１６のランダムなグラフの場合

Graph :
 0 0 0 8 0 0 0 0 1 8 0 0 6 4 0 0
 4 0 0 0 0 3 3 0 0 9 0 0 3 0 2 0
 0 6 0 0 8 0 0 0 6 0 0 0 1 0 0 0
 0 3 2 0 0 0 0 0 0 0 1 0 0 0 9 0
 0 0 5 9 0 0 8 0 0 0 0 0 0 0 2 0
 0 0 0 0 0 0 0 2 3 0 7 0 0 5 0 0
 0 0 3 4 9 0 0 0 0 5 1 2 6 0 5 0
 0 0 0 0 0 0 0 0 0 0 0 4 0 0 0 1
 1 0 4 0 0 0 0 0 0 4 0 0 7 0 0 0
 0 0 0 0 0 0 0 0 0 0 6 0 8 0 1 0
 0 0 0 9 0 0 0 0 9 0 0 0 2 0 0 8
 6 0 0 0 0 0 4 0 0 0 0 0 7 0 0 0
 0 0 0 0 5 0 4 0 0 0 0 0 0 0 1 0
 0 7 0 0 0 7 0 0 0 2 0 0 0 0 7 0
 0 0 0 0 0 0 0 5 0 1 0 9 0 4 0 0
 0 0 0 0 0 5 0 0 0 8 0 0 0 0 6 0

Solution : 0 -> 8 -> 9 -> 14 -> 7 -> 15
Length = 12