source:
downloads/boost_1_34_1/libs/graph/example/dijkstra.expected
@
47
| Last change on this file since 47 was 29, checked in by landauf, 16 years ago | |
|---|---|
| File size: 173 bytes | |
| Rev | Line | |
|---|---|---|
| [29] | 1 | distances from start vertex: |
| 2 | distance(0) = 0 | |
| 3 | distance(1) = 6 | |
| 4 | distance(2) = 1 | |
| 5 | distance(3) = 4 | |
| 6 | distance(4) = 5 | |
| 7 | ||
| 8 | shortest paths tree | |
| 9 | 0 --> 2 | |
| 10 | 1 --> | |
| 11 | 2 --> 3 | |
| 12 | 3 --> 4 | |
| 13 | 4 --> 1 |
Note: See TracBrowser
for help on using the repository browser.
