10 2 1 0 1 0 7 100 0 -1 0.000 0 0 -1 1 0 2
13 2 1 0 1 0 7 100 0 -1 0.000 0 0 -1 1 0 2
16 2 1 0 1 0 7 100 0 -1 0.000 0 0 -1 1 0 2
19 2 1 0 1 0 7 100 0 -1 0.000 0 0 -1 1 0 2
22 2 1 0 1 0 7 100 0 -1 0.000 0 0 -1 1 0 2
25 2 1 0 1 0 7 100 0 -1 0.000 0 0 -1 1 0 2
28 2 1 0 1 0 7 100 0 -1 0.000 0 0 -1 1 0 2
31 2 1 0 1 0 7 100 0 -1 0.000 0 0 -1 1 0 2
34 4 0 0 100 0 14 12 0.0000 4 165 2100 3900 1500 breadth_first_search\001
35 4 0 0 100 0 14 12 0.0000 4 165 1785 4050 2100 best_first_search\001
36 4 0 0 100 0 14 12 0.0000 4 180 2730 5100 2700 prim_minimum_spanning_tree\001
37 4 0 0 100 0 14 12 0.0000 4 180 2415 2400 2700 dijkstra_shortest_paths\001
38 4 0 0 100 0 14 12 0.0000 4 180 2835 900 3300 bellman_ford_shortest_paths\001
39 4 0 0 100 0 14 12 0.0000 4 180 1470 1500 2100 fibonacci_heap\001
40 4 0 0 100 0 14 12 0.0000 4 135 525 1500 1500 queue\001
41 4 0 0 100 0 14 12 0.0000 4 180 3360 3300 3900 johnson_all_pairs_shortest_paths\001
42 4 0 0 100 0 -1 10 0.0000 4 75 555 4350 3225 <<uses>>\001
43 4 0 0 100 0 -1 10 0.0000 4 75 555 3600 3600 <<uses>>\001
44 4 0 0 100 0 -1 10 0.0000 4 75 555 5700 2400 <<uses>>\001
45 4 0 0 100 0 -1 10 0.0000 4 75 555 4875 1800 <<uses>>\001
46 4 0 0 100 0 -1 10 0.0000 4 75 555 3000 1350 <<uses>>\001
47 4 0 0 100 0 -1 10 0.0000 4 75 555 3450 1875 <<uses>>\001
48 4 0 0 100 0 -1 10 0.0000 4 75 555 3975 2475 <<uses>>\001
49 4 0 0 100 0 -1 10 0.0000 4 75 555 3225 2250 <<uses>>\001
50 4 0 0 100 0 14 12 0.0000 4 180 1365 1650 1800 mutable_queue\001