1.1 --- a/src/work/marci/bfs_dfs.h Tue Jun 01 08:30:20 2004 +0000
1.2 +++ b/src/work/marci/bfs_dfs.h Tue Jun 01 11:00:24 2004 +0000
1.3 @@ -151,7 +151,9 @@
1.4 /// The algorithm will search in a bfs order for
1.5 /// the nodes which are \c false initially.
1.6 /// The constructor makes no initial changes on the maps.
1.7 - Bfs<Graph, ReachedMap, PredMap, DistMap>(const Graph& _graph, ReachedMap& _reached, PredMap& _pred, DistMap& _dist) : BfsIterator<Graph, ReachedMap>(_graph, _reached), pred(&_pred), dist(&_dist) { }
1.8 + Bfs<Graph, ReachedMap, PredMap, DistMap>(const Graph& _graph, ReachedMap& _reached, PredMap& _pred, DistMap& _dist) :
1.9 + BfsIterator<Graph, ReachedMap>(_graph, _reached),
1.10 + pred(_pred), dist(_dist) { }
1.11 /// \c s is marked to be reached and pushed in the bfs queue.
1.12 /// If the queue is empty, then the first out-edge is processed.
1.13 /// If \c s was not marked previously, then
1.14 @@ -296,7 +298,7 @@
1.15 /// The algorithm will search in a dfs order for
1.16 /// the nodes which are \c false initially.
1.17 /// The constructor makes no initial changes on the maps.
1.18 - Dfs<Graph, ReachedMap, PredMap>(const Graph& _graph, ReachedMap& _reached, PredMap& _pred) : DfsIterator<Graph, ReachedMap>(_graph, _reached), pred(&_pred) { }
1.19 + Dfs<Graph, ReachedMap, PredMap>(const Graph& _graph, ReachedMap& _reached, PredMap& _pred) : DfsIterator<Graph, ReachedMap>(_graph, _reached), pred(_pred) { }
1.20 /// \c s is marked to be reached and pushed in the bfs queue.
1.21 /// If the queue is empty, then the first out-edge is processed.
1.22 /// If \c s was not marked previously, then