2
0
mirror of https://github.com/boostorg/graph.git synced 2026-01-31 20:22:09 +00:00
Files
graph/examples/prim.expected
Jeremy Siek e57217a52e fixed prim minimum spanning tree. This required a change in
breadth first search, the addition of gray_target and black_target
event points. Also removed the cycle_edge() event from UniformCostVisitor.
Added expected output for miles_span.


[SVN r7903]
2000-10-04 07:44:15 +00:00

10 lines
126 B
Plaintext

parent[a] = x
parent[b] = a
parent[c] = f
parent[d] = c
parent[e] = d
parent[f] = g
parent[g] = h
parent[h] = a
parent[i] = c