equal
deleted
inserted
replaced
61 reader.run(); |
61 reader.run(); |
62 |
62 |
63 Graph::NodeMap<int> color(graph, -2); |
63 Graph::NodeMap<int> color(graph, -2); |
64 |
64 |
65 Graph::NodeMap<int> heapMap(graph, -1); |
65 Graph::NodeMap<int> heapMap(graph, -1); |
66 BucketHeap<Node, Graph::NodeMap<int> > heap(heapMap); |
66 BucketHeap<Graph::NodeMap<int> > heap(heapMap); |
67 |
67 |
68 for (NodeIt it(graph); it != INVALID; ++it) { |
68 for (NodeIt it(graph); it != INVALID; ++it) { |
69 heap.push(it, countOutEdges(graph, it)); |
69 heap.push(it, countOutEdges(graph, it)); |
70 } |
70 } |
71 |
71 |