1.1 --- a/src/work/deba/main.cpp	Sun Apr 17 18:57:22 2005 +0000
     1.2 +++ /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.3 @@ -1,38 +0,0 @@
     1.4 -// -*- c++ -*-
     1.5 -#include <iostream>
     1.6 -#include <cstdlib>
     1.7 -#include "list_graph.h"
     1.8 -
     1.9 -using namespace std;
    1.10 -using namespace lemon;
    1.11 -
    1.12 -
    1.13 -
    1.14 -int main() {
    1.15 -  ListGraph g;
    1.16 -  for (int i = 0; i < 10; ++i) {
    1.17 -    ListGraph::Node node = g.addNode();
    1.18 -  }
    1.19 -  ListGraph::NodeMap<int> map(g, 10);
    1.20 -  for (int i = 0; i < 10; ++i) {
    1.21 -    ListGraph::Node node = g.addNode();
    1.22 -    map[node] = rand()%100;
    1.23 -  }
    1.24 -  for (ListGraph::NodeIt it(g); g.valid(it); g.next(it)) {
    1.25 -    cout << map[it] << endl;
    1.26 -  }
    1.27 -  ListGraph::NodeMap<int>::iterator pit;
    1.28 -  for (pit = map.begin(); pit != map.end(); ++pit) {
    1.29 -    cout << g.id(pit->first) << ' ' << pit->second << endl;
    1.30 -    (*pit).second = g.id(pit->first);
    1.31 -    cout << g.id((*pit).first) << ' ' << (*pit).second << endl;
    1.32 -  }  
    1.33 -  const ListGraph::NodeMap<int> const_map = map;
    1.34 -  ListGraph::NodeMap<int>::const_iterator cit;
    1.35 -  for (cit = const_map.begin(); cit != const_map.end(); ++cit) {
    1.36 -    cerr << g.id(cit->first) << ' ' << cit->second << endl;
    1.37 -    cerr << g.id((*cit).first) << ' ' << (*cit).second << endl;
    1.38 -  }  
    1.39 -  return 0;
    1.40 -}
    1.41 -