Changeset 8:cd54905012bc in lemon-0.x for src/work/bfsdemo.cc

Timestamp:

12/16/03 19:17:51 (19 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

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

Message:

-New test: bfsdemo2.cc added

• Graph class has a NodeMap? and an EdgeMap? member class
• default_bfs_T uning the above Maps is added
• a (property)map must provide a member function SetG() to attach the map to a graph

File:

• src/work/bfsdemo.cc (modified) (4 diffs)

src/work/bfsdemo.cc

@@ -68 +68 @@
     void Put(const IGraph::NodeIterator &n,const value_type &t) { n->isVis=t; }
     value_type Get(const IGraph::NodeIterator &n) const { return n->isVis; }
+    void SetG(IGraph &G) {}
   } visited;
   struct _tree_map_t {
@@ -73 +74 @@
     void Put(const IGraph::NodeIterator &n,const value_type &t)
     { cout << t.From().Index() << "->" << t.To().Index() << '\n'; }
+    void SetG(IGraph &G) {}
   } tree;
   do_nothing_map dist;   //node->int (W)
@@ -90 +92 @@
     void Put(const IGraph::NodeIterator &n,const value_type &t) { n->isVis=t; }
     value_type Get(const IGraph::NodeIterator &n) const { return n->isVis; }
+    void SetG(IGraph &G) {}
   };
   struct tree_map_t {
@@ -95 +98 @@
     void Put(const IGraph::NodeIterator &n,const value_type &t)
     { cout << t.From().Index() << "->" << t.To().Index() << '\n'; }
+    void SetG(IGraph &G) {}
   };
   typedef do_nothing_map dist_map_t;   //node->int (W)