Changeset 78:ecc1171307be in lemon-0.x for src/work/jacint/reverse_bfs.hh

Timestamp:

02/16/04 17:15:58 (19 years ago)

Author:

jacint

Branch:

default

Phase:

public

Convert:

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

Message:

modern valtozat

File:

• src/work/jacint/reverse_bfs.hh (modified) (7 diffs)

src/work/jacint/reverse_bfs.hh

@@ -2 +2 @@
 reverse_bfs
 by jacint
-Performs a bfs on the out edges. It does not count predecessors, 
+Performs a bfs on the out Edges. It does not count predecessors, 
 only the distances, but one can easily modify it to know the pred as well.
 
 Constructor: 
 
-reverse_bfs(graph_type& G, node_iterator t)
+reverse_bfs(graph_type& G, NodeIt t)
 
 
@@ -17 +17 @@
   The following function should be used after run() was already run.
 
-int dist(node_iterator v) : returns the distance from v to t. It is the number of nodes if t is not reachable from v.
+int dist(NodeIt v) : returns the distance from v to t. It is the number of Nodes if t is not reachable from v.
 
 */
@@ -26 +26 @@
 
 #include <marci_graph_traits.hh>
-#include <marci_property_vector.hh>
+#include <marciMap.hh>
 
 
@@ -34 +34 @@
   template <typename graph_type>
   class reverse_bfs {
-    typedef typename graph_traits<graph_type>::node_iterator node_iterator;
-    //typedef typename graph_traits<graph_type>::edge_iterator edge_iterator;
-    typedef typename graph_traits<graph_type>::each_node_iterator each_node_iterator;
-    typedef typename graph_traits<graph_type>::in_edge_iterator in_edge_iterator;
+    typedef typename graph_traits<graph_type>::NodeIt NodeIt;
+    //typedef typename graph_traits<graph_type>::EdgeIt EdgeIt;
+    typedef typename graph_traits<graph_type>::EachNodeIt EachNodeIt;
+    typedef typename graph_traits<graph_type>::InEdgeIt InEdgeIt;
 
 
     graph_type& G;
-    node_iterator t;
-//    node_property_vector<graph_type, edge_iterator> pred;
-    node_property_vector<graph_type, int> distance;
+    NodeIt t;
+//    NodeMap<graph_type, EdgeIt> pred;
+    NodeMap<graph_type, int> distance;
     
 
@@ -49 +49 @@
 
     /*
-      The distance of the nodes is n, except t for which it is 0.
+      The distance of the Nodes is n, except t for which it is 0.
     */
-    reverse_bfs(graph_type& _G, node_iterator _t) : G(_G), t(_t), distance(G, number_of(G.first_node())) {
+    reverse_bfs(graph_type& _G, NodeIt _t) : G(_G), t(_t), distance(G, number_of(G.first_Node())) {
       distance.put(t,0);
     }
@@ -57 +57 @@
     void run() {
 
-      node_property_vector<graph_type, bool> reached(G, false); 
+      NodeMap<graph_type, bool> reached(G, false); 
       reached.put(t, true);
 
-      std::queue<node_iterator> bfs_queue;
+      std::queue<NodeIt> bfs_queue;
       bfs_queue.push(t);
 
       while (!bfs_queue.empty()) {
 
-        node_iterator v=bfs_queue.front();      
+        NodeIt v=bfs_queue.front();     
         bfs_queue.pop();
 
-        for(in_edge_iterator e=G.first_in_edge(v); e.valid(); ++e) {
-          node_iterator w=G.tail(e);
+        for(InEdgeIt e=G.template first<InEdgeIt>(v); e.valid(); ++e) {
+          NodeIt w=G.tail(e);
           if (!reached.get(w)) {
             bfs_queue.push(w);
@@ -81 +81 @@
 
 
-    int dist(node_iterator v) {
+    int dist(NodeIt v) {
       return distance.get(v);
     }