Changeset 174:44700ed9ffaa in lemon-0.x for src/work/iterator_bfs_demo.cc

Timestamp:

03/12/04 10:19:54 (19 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

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

Message:

towards on ListGraph?, SmartGraph? compatibility

File:

• src/work/iterator_bfs_demo.cc (modified) (7 diffs)

src/work/iterator_bfs_demo.cc

@@ +1 @@
+// -*- c++ -*-
 #include <iostream>
 #include <vector>
 #include <string>
 
-#include <list_graph.hh>
-#include <bfs_iterator.hh>
+#include <list_graph.h>
+#include <smart_graph.h>
+#include <bfs_iterator.h>
 #include <graph_wrapper.h>
 
@@ -19 +21 @@
   EdgeNameMap(Graph& _graph, NodeNameMap& _node_name_map) : 
     graph(_graph), node_name_map(_node_name_map) { }
-  string get(typename Graph::EdgeIt e) const { 
+  string get(typename Graph::Edge e) const { 
     return 
       (node_name_map.get(graph.tail(e))+"->"+node_name_map.get(graph.head(e)));
@@ -27 +29 @@
 int main (int, char*[])
 {
-  typedef ListGraph::NodeIt NodeIt;
-  typedef ListGraph::EdgeIt EdgeIt;
-  //typedef ListGraph::EachNodeIt EachNodeIt;
-  //typedef ListGraph::EachEdgeIt EachEdgeIt;
-  //typedef ListGraph::OutEdgeIt OutEdgeIt;
-  //typedef ListGraph::InEdgeIt InEdgeIt;
-  //typedef ListGraph::SymEdgeIt SymEdgeIt;
+  //typedef SmartGraph Graph;
+  typedef ListGraph Graph;
+
+  typedef Graph::Node Node;
+  typedef Graph::Edge Edge;
+  //typedef Graph::NodeIt NodeIt;
+  //typedef Graph::EdgeIt EdgeIt;
+  //typedef Graph::OutEdgeIt OutEdgeIt;
+  //typedef Graph::InEdgeIt InEdgeIt;
+  //typedef Graph::SymEdgeIt SymEdgeIt;
  
-  ListGraph G;
-
-  NodeIt s=G.addNode();
-  NodeIt v1=G.addNode();
-  NodeIt v2=G.addNode();
-  NodeIt v3=G.addNode();
-  NodeIt v4=G.addNode();
-  NodeIt t=G.addNode();
+  Graph G;
+
+  Node s=G.addNode();
+  Node v1=G.addNode();
+  Node v2=G.addNode();
+  Node v3=G.addNode();
+  Node v4=G.addNode();
+  Node t=G.addNode();
   
-  ListGraph::NodeMap<string> node_name(G);
+  Graph::NodeMap<string> node_name(G);
   node_name.set(s, "s");
   node_name.set(v1, "v1");
@@ -73 +78 @@
   cout << "    \\-->    ------------->         "<< endl;
   
-/*
-  {
-  cout << "iterator bfs demo 4 ..." << endl;
-  BfsIterator4< ListGraph, ListGraph::OutEdgeIt, ListGraph::NodeMap<bool> > bfs(G);
-  bfs.pushAndSetReached(s);
-  while (!bfs.finished()) {
-  if (OutEdgeIt(bfs).valid()) {
-  cout << "OutEdgeIt: " << bfs; 
-  cout << " aNode: " << G.aNode(bfs); 
-  cout << " bNode: " << G.bNode(bfs) << " ";
-  } else { 
-  cout << "OutEdgeIt: " << "invalid"; 
-  cout << " aNode: " << bfs.aNode(); 
-  cout << " bNode: " << "invalid" << " ";
-  }
-  if (bfs.isBNodeNewlyReached()) { 
-  cout << "bNodeIsNewlyReached ";
-  } else { 
-  cout << "bNodeIsNotNewlyReached ";
-  } 
-  if (bfs.isANodeExamined()) { 
-  cout << "aNodeIsExamined ";
-  } else { 
-  cout << "aNodeIsNotExamined ";
-  } 
-  cout << endl;
-  ++bfs;
-  }
-  }
-
-  {
-  cout << "iterator dfs demo 4 ..." << endl;
-  DfsIterator4< ListGraph, ListGraph::OutEdgeIt, ListGraph::NodeMap<bool> > dfs(G);
-  dfs.pushAndSetReached(s);
-  while (!dfs.finished()) {
-  ++dfs;
-  if (OutEdgeIt(dfs).valid()) {
-  cout << "OutEdgeIt: " << dfs; 
-  cout << " aNode: " << G.aNode(dfs); 
-  cout << " bNode: " << G.bNode(dfs) << " ";
-  } else { 
-  cout << "OutEdgeIt: " << "invalid"; 
-  cout << " aNode: " << dfs.aNode(); 
-  cout << " bNode: " << "invalid" << " ";
-  }
-  if (dfs.isBNodeNewlyReached()) { 
-  cout << "bNodeIsNewlyReached ";
-  } else { 
-  cout << "bNodeIsNotNewlyReached ";
-  } 
-  if (dfs.isANodeExamined()) { 
-  cout << "aNodeIsExamined ";
-  } else { 
-  cout << "aNodeIsNotExamined ";
-  } 
-  cout << endl;
-  //++dfs;
-  }
-  }
-*/
-
-//   typedef TrivGraphWrapper<const ListGraph> CGW;
+//   typedef TrivGraphWrapper<const Graph> CGW;
 //   CGW wG(G);
 
 //   cout << "bfs and dfs demo on the directed graph" << endl;
-//   for(CGW::EachNodeIt n=wG.first<CGW::EachNodeIt>(); n.valid(); ++n) { 
+//   for(CGW::NodeIt n=wG.first<CGW::NodeIt>(); n.valid(); ++n) { 
 //     cout << n << ": ";
 //     cout << "out edges: ";
@@ -150 +94 @@
 
   {
-    typedef TrivGraphWrapper<const ListGraph> GW;
+    typedef TrivGraphWrapper<const Graph> GW;
     GW wG(G);
 
-    EdgeNameMap< GW, ListGraph::NodeMap<string> > edge_name(wG, node_name);
+    EdgeNameMap< GW, Graph::NodeMap<string> > edge_name(wG, node_name);
     
     cout << "bfs and dfs iterator demo on the directed graph" << endl;
-    for(GW::EachNodeIt n=wG.first<GW::EachNodeIt>(); wG.valid(n); wG.next(n)) { 
+    for(GW::NodeIt n=wG.first<GW::NodeIt>(); wG.valid(n); wG.next(n)) { 
       cout << node_name.get(n) << ": ";
       cout << "out edges: ";
@@ -226 +170 @@
 
   {
-    typedef RevGraphWrapper<const ListGraph> GW;
+    typedef RevGraphWrapper<const Graph> GW;
     GW wG(G);
     
-    EdgeNameMap< GW, ListGraph::NodeMap<string> > edge_name(wG, node_name);
+    EdgeNameMap< GW, Graph::NodeMap<string> > edge_name(wG, node_name);
     
     cout << "bfs and dfs iterator demo on the reversed directed graph" << endl;
-    for(GW::EachNodeIt n=wG.first<GW::EachNodeIt>(); wG.valid(n); wG.next(n)) { 
+    for(GW::NodeIt n=wG.first<GW::NodeIt>(); wG.valid(n); wG.next(n)) { 
       cout << node_name.get(n) << ": ";
       cout << "out edges: ";
@@ -301 +245 @@
 
   {
-    typedef UndirGraphWrapper<const ListGraph> GW;
+    typedef UndirGraphWrapper<const Graph> GW;
     GW wG(G);
     
-    EdgeNameMap< GW, ListGraph::NodeMap<string> > edge_name(wG, node_name);
+    EdgeNameMap< GW, Graph::NodeMap<string> > edge_name(wG, node_name);
     
     cout << "bfs and dfs iterator demo on the undirected graph" << endl;
-    for(GW::EachNodeIt n=wG.first<GW::EachNodeIt>(); wG.valid(n); wG.next(n)) { 
+    for(GW::NodeIt n=wG.first<GW::NodeIt>(); wG.valid(n); wG.next(n)) { 
       cout << node_name.get(n) << ": ";
       cout << "out edges: ";