diff -r ee5959aa4410 -r c280de819a73 src/work/deba/main.cpp
--- a/src/work/deba/main.cpp	Sun Apr 17 18:57:22 2005 +0000
+++ /dev/null	Thu Jan 01 00:00:00 1970 +0000
@@ -1,38 +0,0 @@
-// -*- c++ -*-
-#include <iostream>
-#include <cstdlib>
-#include "list_graph.h"
-
-using namespace std;
-using namespace lemon;
-
-
-
-int main() {
-  ListGraph g;
-  for (int i = 0; i < 10; ++i) {
-    ListGraph::Node node = g.addNode();
-  }
-  ListGraph::NodeMap<int> map(g, 10);
-  for (int i = 0; i < 10; ++i) {
-    ListGraph::Node node = g.addNode();
-    map[node] = rand()%100;
-  }
-  for (ListGraph::NodeIt it(g); g.valid(it); g.next(it)) {
-    cout << map[it] << endl;
-  }
-  ListGraph::NodeMap<int>::iterator pit;
-  for (pit = map.begin(); pit != map.end(); ++pit) {
-    cout << g.id(pit->first) << ' ' << pit->second << endl;
-    (*pit).second = g.id(pit->first);
-    cout << g.id((*pit).first) << ' ' << (*pit).second << endl;
-  }  
-  const ListGraph::NodeMap<int> const_map = map;
-  ListGraph::NodeMap<int>::const_iterator cit;
-  for (cit = const_map.begin(); cit != const_map.end(); ++cit) {
-    cerr << g.id(cit->first) << ' ' << cit->second << endl;
-    cerr << g.id((*cit).first) << ' ' << (*cit).second << endl;
-  }  
-  return 0;
-}
-