1.1 --- a/src/work/akos/loader_demo.cc	Tue Jan 25 18:37:31 2005 +0000
     1.2 +++ /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.3 @@ -1,34 +0,0 @@
     1.4 -#include <vector>
     1.5 -#include <iostream>
     1.6 -#include <list_graph.hh>
     1.7 -#include <bfs_iterator.hh>
     1.8 -#include <loader.h>
     1.9 -
    1.10 -using namespace lemon;
    1.11 -
    1.12 -int main(int, char **) {
    1.13 -  typedef ListGraph::NodeIt NodeIt;
    1.14 -  typedef ListGraph::EdgeIt EdgeIt;
    1.15 -  typedef ListGraph::EachNodeIt EachNodeIt;
    1.16 -  typedef ListGraph::EachEdgeIt EachEdgeIt;
    1.17 -  typedef ListGraph::OutEdgeIt OutEdgeIt;
    1.18 -  typedef ListGraph::InEdgeIt InEdgeIt;
    1.19 -  typedef ListGraph::SymEdgeIt SymEdgeIt;
    1.20 -
    1.21 -  ListGraph G;
    1.22 -  LoadGraph(G, "demo.in");
    1.23 -
    1.24 -  std::cout << "bfs from the first node" << std::endl;
    1.25 -  bfs<ListGraph> bfs_test(G, G.first<EachNodeIt>());
    1.26 -  bfs_test.run();
    1.27 -  std::cout << "reached: ";
    1.28 -  for(EachNodeIt i=G.first<EachNodeIt>(); i.valid(); ++i) {
    1.29 -    std::cout << bfs_test.reached.get(i) << " ";
    1.30 -  }
    1.31 -  std::cout<<std::endl;
    1.32 -  std::cout << "dist: ";
    1.33 -  for(EachNodeIt i=G.first<EachNodeIt>(); i.valid(); ++i) {
    1.34 -    std::cout << bfs_test.dist.get(i) << " ";
    1.35 -  }
    1.36 -  std::cout<<std::endl;
    1.37 -}