Changeset 650:588ff2ca55bd in lemon-0.x for src/work/marci/bfs_dfs.h

Timestamp:

05/20/04 17:40:59 (19 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@850

Message:

a

File:

• src/work/marci/bfs_dfs.h (modified) (10 diffs)

src/work/marci/bfs_dfs.h

@@ -21 +21 @@
   /// Bfs searches for the nodes wich are not marked in 
   /// \c reached_map
-  /// Reached have to work as read-write bool Node-map.
+  /// Reached have to be a read-write bool node-map.
   /// \ingroup galgs
   template <typename Graph, /*typename OutEdgeIt,*/ 
@@ -37 +37 @@
   public:
     /// In that constructor \c _reached have to be a reference 
-    /// for a bool Node-map. The algorithm will search in a bfs order for 
-    /// the nodes which are \c false initially
+    /// for a bool bode-map. The algorithm will search for the 
+    /// initially \c false nodes 
+    /// in a bfs order.
     BfsIterator(const Graph& _graph, ReachedMap& _reached) : 
       graph(&_graph), reached(_reached), 
@@ -44 +45 @@
     /// The same as above, but the map storing the reached nodes 
     /// is constructed dynamically to everywhere false.
+    /// \deprecated
     BfsIterator(const Graph& _graph) : 
       graph(&_graph), reached(*(new ReachedMap(*graph /*, false*/))), 
@@ -122 +124 @@
     Node bNode() const { return graph->bNode(actual_edge); }
     /// Guess what?
+    /// \deprecated 
     const ReachedMap& getReachedMap() const { return reached; }
     /// Guess what?
+    /// \deprecated
     const std::queue<Node>& getBfsQueue() const { return bfs_queue; }
   };
@@ -130 +134 @@
   /// \c reached_map
   /// Reached have to work as a read-write bool Node-map, 
-  /// Pred is a write Edge Node-map and
-  /// Dist is a read-write Node-map of integral value, have to be. 
+  /// Pred is a write edge node-map and
+  /// Dist is a read-write node-map of integral value, have to be. 
   /// \ingroup galgs
   template <typename Graph, 
@@ -180 +184 @@
     }
     /// Guess what?
+    /// \deprecated 
     const PredMap& getPredMap() const { return pred; }
     /// Guess what?
+    /// \deprecated
     const DistMap& getDistMap() const { return dist; }
   };
@@ -204 +210 @@
   public:
     /// In that constructor \c _reached have to be a reference 
-    /// for a bool Node-map. The algorithm will search in a dfs order for 
+    /// for a bool node-map. The algorithm will search in a dfs order for 
     /// the nodes which are \c false initially
     DfsIterator(const Graph& _graph, ReachedMap& _reached) : 
@@ -266 +272 @@
     Node bNode() const { return graph->bNode(actual_edge); }
     /// Guess what?
+    /// \deprecated
     const ReachedMap& getReachedMap() const { return reached; }
     /// Guess what?
+    /// \deprecated
     const std::stack<OutEdgeIt>& getDfsStack() const { return dfs_stack; }
   };
@@ -273 +281 @@
   /// Dfs searches for the nodes wich are not marked in 
   /// \c reached_map
-  /// Reached is a read-write bool Node-map, 
-  /// Pred is a write Node-map, have to be.
+  /// Reached is a read-write bool node-map, 
+  /// Pred is a write node-map, have to be.
   /// \ingroup galgs
   template <typename Graph, 
@@ -319 +327 @@
     }
     /// Guess what?
+    /// \deprecated
     const PredMap& getPredMap() const { return pred; }
   };