src/work/marci/experiment/bfs_iterator.h
changeset 937 d4e911acef3d
parent 281 3fefabfd00b7
equal deleted inserted replaced
0:7fc162c34b43 1:dc2663b7a9b5
     1 // -*- c++ -*-
     1 // -*- c++ -*-
     2 #ifndef HUGO_BFS_ITERATOR_H
     2 #ifndef LEMON_BFS_ITERATOR_H
     3 #define HUGO_BFS_ITERATOR_H
     3 #define LEMON_BFS_ITERATOR_H
     4 
     4 
     5 #include <queue>
     5 #include <queue>
     6 #include <stack>
     6 #include <stack>
     7 #include <utility>
     7 #include <utility>
     8 #include <graph_wrapper.h>
     8 #include <graph_wrapper.h>
     9 
     9 
    10 namespace hugo {
    10 namespace lemon {
    11 
    11 
    12 //   template <typename Graph>
    12 //   template <typename Graph>
    13 //   struct bfs {
    13 //   struct bfs {
    14 //     typedef typename Graph::Node Node;
    14 //     typedef typename Graph::Node Node;
    15 //     typedef typename Graph::Edge Edge;
    15 //     typedef typename Graph::Edge Edge;
   834     const std::stack<OutEdgeIt>& getDfsStack() const { return dfs_stack; }
   834     const std::stack<OutEdgeIt>& getDfsStack() const { return dfs_stack; }
   835   };
   835   };
   836 
   836 
   837 
   837 
   838 
   838 
   839 } // namespace hugo
   839 } // namespace lemon
   840 
   840 
   841 #endif //HUGO_BFS_ITERATOR_H
   841 #endif //LEMON_BFS_ITERATOR_H