Changeset 3:272a5677bd6d in lemon-0.x for src/include/bfs.h

Timestamp:

12/13/03 16:44:50 (20 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

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

Message:

• Marci type iterator constructors
• src/demo/bfsdemo.cc: demo for bfs.h
• cosmetical changes

File:

• src/include/bfs.h (modified) (12 diffs)

src/include/bfs.h

@@ -39 +39 @@
   
   
-//   Nem jo! Osszeakad a masik Set-tel
+//   Nem jo! Osszeakad a masik Put-tel
 //   class do_nothing_map {};
 //   template <typename V,typename T>
-//   void Set(const do_nothing_map &p,const V &v,const T &t) {}
+//   void Put(const do_nothing_map &p,const V &v,const T &t) {}
   
   struct do_nothing_map {
   template <typename V,typename T>
-  static void Set(V v,T t) {}
+  static void Put(V v,T t) {}
   };
   
@@ -54 +54 @@
   public:
     typedef T value_type;
-    static void Set(const I &i, const T &t) {(*i).*M=t;}
+    static void Put(const I &i, const T &t) {(*i).*M=t;}
     static T Get(const I i) {return (*i).*M;}
     T &operator[](I i) {return (*i).*M;}
@@ -61 +61 @@
   /* 
      template <typename C,typename I,typename T, T C::*M>
-     void Set(class_element_map<C,T,M> p,I i, T t)
+     void Put(class_element_map<C,T,M> p,I i, T t)
      {
      i->*M=t;   
@@ -68 +68 @@
 
   template <typename P,typename I,typename T>
-  inline void Set(P &p,const I &i, const T &t)
-  {
-    p.Set(i,t);   
+  inline void Put(P &p,const I &i, const T &t)
+  {
+    p.Put(i,t);   
   };
   template <typename P,typename I>
@@ -126 +126 @@
       bfs_node_data<G> NodeType::*d;
       typedef bool value_type;
-      void Set(typename G::NodeIterator &i, const value_type &t)
+      void Put(typename G::NodeIterator &i, const value_type &t)
       {((*i).*d).visited=t;}
       value_type Get(const typename G::NodeIterator &i) const
@@ -137 +137 @@
       bfs_node_data<G> NodeType::*d;
       typedef typename G::EdgeIterator value_type;
-      void Set(typename G::NodeIterator &i, const value_type &t)
+      void Put(typename G::NodeIterator &i, const value_type &t)
       {((*i).*d).tree=t;}
       value_type Get(const typename G::NodeIterator &i) const
@@ -148 +148 @@
       bfs_node_data<G> NodeType::*d;
       typedef int value_type;
-      void Set(typename G::NodeIterator &i, const value_type &t)
+      void Put(typename G::NodeIterator &i, const value_type &t)
       {((*i).*d).dist=t;}
       value_type Get(const typename G::NodeIterator &i) const
@@ -159 +159 @@
       bfs_node_data<G> NodeType::*d;
       typedef int value_type;
-      void Set(typename G::NodeIterator &i,  const value_type &t)
+      void Put(typename G::NodeIterator &i,  const value_type &t)
       {((*i).*d).priority=t;}
       value_type Get(const typename G::NodeIterator &i) const
@@ -176 +176 @@
     bfs_static_maps(const bfs_node_data<G> NodeType::*dd) 
     {
-      SetDataField(dd);
+      PutDataField(dd);
     }
     
@@ -211 +211 @@
     
     for(Gr.GetFirst(n);n.isValid();++n)
-      Set(maps.visited,n,false);
+      Put(maps.visited,n,false);
     
     queue<Q_T> Q;
@@ -218 +218 @@
     q.dist=0;
     Q.push(q);
-    Set(maps.visited,start_node,true);
-    //      Set(maps::tree,start_node,?????);
-    Set(maps.dist,start_node,0);
-    Set(maps.priority,start_node,pr++);
+    Put(maps.visited,start_node,true);
+    //      Put(maps::tree,start_node,?????);
+    Put(maps.dist,start_node,0);
+    Put(maps.priority,start_node,pr++);
     
     do {
@@ -231 +231 @@
           q.dist=d;
           Q.push(q);
-          Set(maps.visited,m,true);
-          Set(maps.tree,m,e);
-          Set(maps.dist,m,d);
-          Set(maps.priority,m,pr++);
+          Put(maps.visited,m,true);
+          Put(maps.tree,m,e);
+          Put(maps.dist,m,d);
+          Put(maps.priority,m,pr++);
         }
     } while(!Q.empty());