equal
deleted
inserted
replaced
278 |
278 |
279 for(NodeIterator n(*G);n.isValid();++n) |
279 for(NodeIterator n(*G);n.isValid();++n) |
280 Put(visited_map,n,false); |
280 Put(visited_map,n,false); |
281 |
281 |
282 priority=0; |
282 priority=0; |
283 |
|
284 } |
283 } |
285 |
284 |
286 void AddStartNode(const NodeIterator &start_node,int dist=0) |
285 void AddStartNode(const NodeIterator &start_node,int dist=0) |
287 { |
286 { |
288 bfs_queue_cont q; |
287 bfs_queue_cont q; |
296 Put(priority_map,start_node,priority++); |
295 Put(priority_map,start_node,priority++); |
297 } |
296 } |
298 |
297 |
299 void Init(const NodeIterator &start_node,int dist=0) |
298 void Init(const NodeIterator &start_node,int dist=0) |
300 { |
299 { |
301 |
|
302 Init(); |
300 Init(); |
303 AddStartNode(start_node,dist); |
301 AddStartNode(start_node,dist); |
304 } |
302 } |
305 |
303 |
306 void Run() |
304 void Run() |