marci@75: #include <iostream>
marci@75: #include <vector>
marci@75: #include <string>
marci@75: 
marci@75: #include <list_graph.hh>
marci@75: #include <bfs_iterator.hh>
marci@75: #include <graph_wrapper.h>
marci@75: 
alpar@107: using namespace hugo;
marci@75: 
marci@75: int main (int, char*[])
marci@75: {
marci@75:   typedef ListGraph::NodeIt NodeIt;
marci@75:   typedef ListGraph::EdgeIt EdgeIt;
marci@75:   typedef ListGraph::EachNodeIt EachNodeIt;
marci@75:   typedef ListGraph::EachEdgeIt EachEdgeIt;
marci@75:   typedef ListGraph::OutEdgeIt OutEdgeIt;
marci@75:   typedef ListGraph::InEdgeIt InEdgeIt;
marci@75:   typedef ListGraph::SymEdgeIt SymEdgeIt;
marci@75:  
marci@75:   ListGraph G;
marci@75: 
marci@75:   NodeIt s=G.addNode();
marci@75:   NodeIt v1=G.addNode();
marci@75:   NodeIt v2=G.addNode();
marci@75:   NodeIt v3=G.addNode();
marci@75:   NodeIt v4=G.addNode();
marci@75:   NodeIt t=G.addNode();
marci@75:   
marci@75:   G.addEdge(s, v1);
marci@75:   G.addEdge(s, v2);
marci@75:   G.addEdge(v1, v2);
marci@75:   G.addEdge(v2, v1);
marci@75:   G.addEdge(v1, v3);
marci@75:   G.addEdge(v3, v2);
marci@75:   G.addEdge(v2, v4);
marci@75:   G.addEdge(v4, v3);
marci@75:   G.addEdge(v3, t);
marci@75:   G.addEdge(v4, t);
marci@75: 
marci@75:   std::cout << "bfs and dfs demo on the directed graph" << std::endl;
marci@75:   for(EachNodeIt i=G.first<EachNodeIt>(); i.valid(); ++i) { 
marci@75:     std::cout << i << ": ";
marci@75:     std::cout << "out edges: ";
marci@75:     for(OutEdgeIt j=G.first<OutEdgeIt>(i); j.valid(); ++j) 
marci@75:       std::cout << j << " ";
marci@75:     std::cout << "in edges: ";
marci@75:     for(InEdgeIt j=G.first<InEdgeIt>(i); j.valid(); ++j) 
marci@75:       std::cout << j << " ";
marci@75:     std::cout << std::endl;
marci@75:   }
marci@75:   
marci@75:   {
marci@75:     std::cout << "iterator bfs demo 4 ..." << std::endl;
marci@75:     BfsIterator4< ListGraph, ListGraph::OutEdgeIt, ListGraph::NodeMap<bool> > bfs(G);
marci@75:     bfs.pushAndSetReached(s);
marci@75:     while (!bfs.finished()) {
marci@75:       if (OutEdgeIt(bfs).valid()) {
marci@75: 	std::cout << "OutEdgeIt: " << bfs; 
marci@75: 	std::cout << " aNode: " << G.aNode(bfs); 
marci@75: 	std::cout << " bNode: " << G.bNode(bfs) << " ";
marci@75:       } else { 
marci@75: 	std::cout << "OutEdgeIt: " << "invalid"; 
marci@75: 	std::cout << " aNode: " << bfs.aNode(); 
marci@75: 	std::cout << " bNode: " << "invalid" << " ";
marci@75:       }
marci@75:       if (bfs.isBNodeNewlyReached()) { 
marci@75: 	std::cout << "bNodeIsNewlyReached ";
marci@75:       } else { 
marci@75: 	std::cout << "bNodeIsNotNewlyReached ";
marci@75:       } 
marci@75:       if (bfs.isANodeExamined()) { 
marci@75: 	std::cout << "aNodeIsExamined ";
marci@75:       } else { 
marci@75: 	std::cout << "aNodeIsNotExamined ";
marci@75:       } 
marci@75:       std::cout<<std::endl;
marci@75:       ++bfs;
marci@75:     }
marci@75:   }
marci@75: 
marci@99:   {
marci@99:     std::cout << "iterator dfs demo 4 ..." << std::endl;
marci@99:     DfsIterator4< ListGraph, ListGraph::OutEdgeIt, ListGraph::NodeMap<bool> > dfs(G);
marci@99:     dfs.pushAndSetReached(s);
marci@99:     while (!dfs.finished()) {
marci@99:       ++dfs;
marci@99:       if (OutEdgeIt(dfs).valid()) {
marci@99: 	std::cout << "OutEdgeIt: " << dfs; 
marci@99: 	std::cout << " aNode: " << G.aNode(dfs); 
marci@99: 	std::cout << " bNode: " << G.bNode(dfs) << " ";
marci@99:       } else { 
marci@99: 	std::cout << "OutEdgeIt: " << "invalid"; 
marci@99: 	std::cout << " aNode: " << dfs.aNode(); 
marci@99: 	std::cout << " bNode: " << "invalid" << " ";
marci@99:       }
marci@99:       if (dfs.isBNodeNewlyReached()) { 
marci@99: 	std::cout << "bNodeIsNewlyReached ";
marci@99:       } else { 
marci@99: 	std::cout << "bNodeIsNotNewlyReached ";
marci@99:       } 
marci@99:       if (dfs.isANodeExamined()) { 
marci@99: 	std::cout << "aNodeIsExamined ";
marci@99:       } else { 
marci@99: 	std::cout << "aNodeIsNotExamined ";
marci@99:       } 
marci@99:       std::cout<<std::endl;
marci@99:       //++dfs;
marci@99:     }
marci@99:   }
marci@99: 
marci@99: 
marci@75:   typedef ConstTrivGraphWrapper<ListGraph> CTGW;
marci@75:   CTGW wG(G);
marci@75: 
marci@75:   std::cout << "bfs and dfs demo on the directed graph" << std::endl;
marci@75:   for(CTGW::EachNodeIt i=wG.first<CTGW::EachNodeIt>(); i.valid(); ++i) { 
marci@75:     std::cout << i << ": ";
marci@75:     std::cout << "out edges: ";
marci@75:     for(CTGW::OutEdgeIt j=wG.first<CTGW::OutEdgeIt>(i); j.valid(); ++j) 
marci@75:       std::cout << j << " ";
marci@75:     std::cout << "in edges: ";
marci@75:     for(CTGW::InEdgeIt j=wG.first<CTGW::InEdgeIt>(i); j.valid(); ++j) 
marci@75:       std::cout << j << " ";
marci@75:     std::cout << std::endl;
marci@75:   }
marci@75: 
marci@75: 
marci@75:   {
marci@75:     std::cout << "iterator bfs demo 5 ..." << std::endl;
marci@75:     BfsIterator5< CTGW, CTGW::NodeMap<bool> > bfs(wG);
marci@75:     bfs.pushAndSetReached(s);
marci@75:     while (!bfs.finished()) {
marci@75:       if (OutEdgeIt(bfs).valid()) {
marci@75: 	std::cout << "OutEdgeIt: " << bfs; 
marci@75: 	std::cout << " aNode: " << wG.aNode(bfs); 
marci@75: 	std::cout << " bNode: " << wG.bNode(bfs) << " ";
marci@75:       } else { 
marci@75: 	std::cout << "OutEdgeIt: " << "invalid"; 
marci@75: 	std::cout << " aNode: " << bfs.aNode(); 
marci@75: 	std::cout << " bNode: " << "invalid" << " ";
marci@75:       }
marci@75:       if (bfs.isBNodeNewlyReached()) { 
marci@75: 	std::cout << "bNodeIsNewlyReached ";
marci@75:       } else { 
marci@75: 	std::cout << "bNodeIsNotNewlyReached ";
marci@75:       } 
marci@75:       if (bfs.isANodeExamined()) { 
marci@75: 	std::cout << "aNodeIsExamined ";
marci@75:       } else { 
marci@75: 	std::cout << "aNodeIsNotExamined ";
marci@75:       } 
marci@75:       std::cout<<std::endl;
marci@75:       ++bfs;
marci@75:     }
marci@75:   }
marci@75: 
marci@75: 
marci@75:   return 0;
marci@75: }