diff -r e45bf7830d8c -r 708df4dc6ab6 src/work/marci/bfs_dfs.h
--- a/src/work/marci/bfs_dfs.h	Tue Jun 01 08:30:20 2004 +0000
+++ b/src/work/marci/bfs_dfs.h	Tue Jun 01 11:00:24 2004 +0000
@@ -151,7 +151,9 @@
     /// The algorithm will search in a bfs order for 
     /// the nodes which are \c false initially. 
     /// The constructor makes no initial changes on the maps.
-    Bfs<Graph, ReachedMap, PredMap, DistMap>(const Graph& _graph, ReachedMap& _reached, PredMap& _pred, DistMap& _dist) : BfsIterator<Graph, ReachedMap>(_graph, _reached), pred(&_pred), dist(&_dist) { }
+    Bfs<Graph, ReachedMap, PredMap, DistMap>(const Graph& _graph, ReachedMap& _reached, PredMap& _pred, DistMap& _dist) : 
+      BfsIterator<Graph, ReachedMap>(_graph, _reached), 
+      pred(_pred), dist(_dist) { }
     /// \c s is marked to be reached and pushed in the bfs queue.
     /// If the queue is empty, then the first out-edge is processed.
     /// If \c s was not marked previously, then 
@@ -296,7 +298,7 @@
     /// The algorithm will search in a dfs order for 
     /// the nodes which are \c false initially. 
     /// The constructor makes no initial changes on the maps.
-    Dfs<Graph, ReachedMap, PredMap>(const Graph& _graph, ReachedMap& _reached, PredMap& _pred) : DfsIterator<Graph, ReachedMap>(_graph, _reached), pred(&_pred) { }
+    Dfs<Graph, ReachedMap, PredMap>(const Graph& _graph, ReachedMap& _reached, PredMap& _pred) : DfsIterator<Graph, ReachedMap>(_graph, _reached), pred(_pred) { }
     /// \c s is marked to be reached and pushed in the bfs queue.
     /// If the queue is empty, then the first out-edge is processed.
     /// If \c s was not marked previously, then