| #FIG 3.2 |
| Landscape |
| Center |
| Inches |
| Letter |
| 100.00 |
| Single |
| -2 |
| 1200 2 |
| 2 1 0 1 0 7 100 0 -1 0.000 0 0 -1 1 0 2 |
| 1 1 1.00 60.00 120.00 |
| 3600 2550 4500 2100 |
| 2 1 0 1 0 7 100 0 -1 0.000 0 0 -1 1 0 2 |
| 1 1 1.00 60.00 120.00 |
| 4800 3750 3750 3300 |
| 2 1 0 1 0 7 100 0 -1 0.000 0 0 -1 1 0 2 |
| 1 1 1.00 60.00 120.00 |
| 4950 3750 3450 2700 |
| 2 1 0 1 0 7 100 0 -1 0.000 0 0 -1 1 0 2 |
| 1 1 1.00 60.00 120.00 |
| 4800 1950 4800 1500 |
| 2 1 0 1 0 7 100 0 -1 0.000 0 0 -1 1 0 2 |
| 1 1 1.00 60.00 120.00 |
| 6000 2550 5100 2100 |
| 2 1 0 1 0 7 100 0 -1 0.000 0 0 -1 1 0 2 |
| 1 1 1.00 60.00 120.00 |
| 3900 1425 2025 1425 |
| 2 1 0 1 0 7 100 0 -1 0.000 0 0 -1 1 0 2 |
| 1 1 1.00 60.00 120.00 |
| 3975 2025 3000 2025 |
| 2 1 0 1 0 7 100 0 -1 0.000 0 0 -1 1 0 2 |
| 1 1 1.00 60.00 120.00 |
| 3975 2025 3000 1800 |
| 4 0 0 100 0 14 12 0.0000 4 165 2100 3900 1500 breadth_first_search\001 |
| 4 0 0 100 0 14 12 0.0000 4 165 1785 4050 2100 best_first_search\001 |
| 4 0 0 100 0 14 12 0.0000 4 180 2730 5100 2700 prim_minimum_spanning_tree\001 |
| 4 0 0 100 0 14 12 0.0000 4 180 2415 2400 2700 dijkstra_shortest_paths\001 |
| 4 0 0 100 0 14 12 0.0000 4 180 2835 900 3300 bellman_ford_shortest_paths\001 |
| 4 0 0 100 0 14 12 0.0000 4 180 1470 1500 2100 fibonacci_heap\001 |
| 4 0 0 100 0 14 12 0.0000 4 135 525 1500 1500 queue\001 |
| 4 0 0 100 0 14 12 0.0000 4 180 3360 3300 3900 johnson_all_pairs_shortest_paths\001 |
| 4 0 0 100 0 -1 10 0.0000 4 75 555 4350 3225 <<uses>>\001 |
| 4 0 0 100 0 -1 10 0.0000 4 75 555 3600 3600 <<uses>>\001 |
| 4 0 0 100 0 -1 10 0.0000 4 75 555 5700 2400 <<uses>>\001 |
| 4 0 0 100 0 -1 10 0.0000 4 75 555 4875 1800 <<uses>>\001 |
| 4 0 0 100 0 -1 10 0.0000 4 75 555 3000 1350 <<uses>>\001 |
| 4 0 0 100 0 -1 10 0.0000 4 75 555 3450 1875 <<uses>>\001 |
| 4 0 0 100 0 -1 10 0.0000 4 75 555 3975 2475 <<uses>>\001 |
| 4 0 0 100 0 -1 10 0.0000 4 75 555 3225 2250 <<uses>>\001 |
| 4 0 0 100 0 14 12 0.0000 4 180 1365 1650 1800 mutable_queue\001 |