Index: c/work/akos/demo.in
===================================================================
--- src/work/akos/demo.in	(revision 63)
+++ 	(revision )
@@ -1,17 +1,0 @@
-c
-c        This is a simple example file to demonstrate the
-c     DIMACS input file format for minimum-cost flow problems.
-c 
-c problem line :
-p min 4 5
-c
-c node descriptor lines :
-n 1 4
-n 4 -4
-c
-c arc descriptor lines :
-a 1 2 0 4 2
-a 1 3 0 2 2
-a 2 3 0 2 1
-a 2 4 0 3 3
-a 3 4 0 5 1
Index: c/work/akos/k_cover.cc
===================================================================
--- src/work/akos/k_cover.cc	(revision 1024)
+++ 	(revision )
@@ -1,58 +1,0 @@
-#include <lemon/list_graph.h>
-
-using namespace lemon;
-
-typedef ListGraph Graph;
-typedef Graph::NodeIt NodeIt;
-typedef Graph::EdgeIt EdgeIt;
-
-class MyEntity {
-public:
-  Graph &g;
-  Graph::NodeMap<bool> selected;
-  int edges;
-  int covered_edges;
-
-  MyEntity(Graph &_g) : g(_g), selected(_g) {}
-  MyEntity(MyEntity& e) : g(e.g), selected(e.g) {
-    for (NodeIt n(g); n != INVALID; ++n) {
-      selected[n] = e.selected[n];
-    }
-    edges = e.edges;
-    covered_edges = e.covered_edges;
-  }
-  double getCost() {
-    return (double) (edges - covered_edges);
-  }
-  void mutate() {
-  
-  }
-  void revert() {
-  
-  }
-};
-
-int main() {
-  Graph g;
-  // beolvasas
-  MyEntity ent(g);
-
-  // kezdeti lefedes generalasa
-  int nn = 0;
-  for (NodeIt n(g); n != INVALID; ++n) {
-    ent.selected[n] = false;
-    nn++;
-  }
-  // k db random node kivalasztasa
-
-  int i = 0, j = 0;
-  for (EdgeIt e(g); e != INVALID; ++e) {
-    i++;
-    if ((ent.selected[g.source(e)]) || (ent.selected[g.target(e)])) {
-      j++;
-    }
-  }
-  ent.edges = i;
-  ent.covered_edges = j;
-
-}
Index: c/work/akos/loader.h
===================================================================
--- src/work/akos/loader.h	(revision 63)
+++ 	(revision )
@@ -1,41 +1,0 @@
-#ifndef LOADER_H
-#define LOADER_H
-
-#include <map>
-
-#define LINE_LEN 1024
-
-template<typename Graph>
-void LoadGraph(Graph &G, char *filename) {
-  FILE *file;
-  if ((file = fopen(filename, "r")) == NULL) {
-    printf("Could not open %s\n", filename);
-    return;
-  }
-  int i, n1, n2;
-  std::map<int, typename Graph::NodeIt> nmap;
-  char line[LINE_LEN];
-  while (fgets(line, LINE_LEN, file)) {
-    switch (line[0]) {
-      case 'n':
-        nmap[atoi(line + 1)] = G.addNode();
-        break;
-      case 'a':
-        n1 = atoi(line + 1);
-        i = 1;
-        while (isspace(line[i])) i++;
-        while (isdigit(line[i])) i++;
-        n2 = atoi(line + i);
-        if (nmap.find(n1) == nmap.end()) {
-          nmap[n1] = G.addNode();
-        }
-        if (nmap.find(n2) == nmap.end()) {
-          nmap[n2] = G.addNode();
-        }
-        G.addEdge(nmap[n1], nmap[n2]);
-        break;
-    }
-  }
-}
-
-#endif
Index: c/work/akos/loader_demo.cc
===================================================================
--- src/work/akos/loader_demo.cc	(revision 921)
+++ 	(revision )
@@ -1,34 +1,0 @@
-#include <vector>
-#include <iostream>
-#include <list_graph.hh>
-#include <bfs_iterator.hh>
-#include <loader.h>
-
-using namespace lemon;
-
-int main(int, char **) {
-  typedef ListGraph::NodeIt NodeIt;
-  typedef ListGraph::EdgeIt EdgeIt;
-  typedef ListGraph::EachNodeIt EachNodeIt;
-  typedef ListGraph::EachEdgeIt EachEdgeIt;
-  typedef ListGraph::OutEdgeIt OutEdgeIt;
-  typedef ListGraph::InEdgeIt InEdgeIt;
-  typedef ListGraph::SymEdgeIt SymEdgeIt;
-
-  ListGraph G;
-  LoadGraph(G, "demo.in");
-
-  std::cout << "bfs from the first node" << std::endl;
-  bfs<ListGraph> bfs_test(G, G.first<EachNodeIt>());
-  bfs_test.run();
-  std::cout << "reached: ";
-  for(EachNodeIt i=G.first<EachNodeIt>(); i.valid(); ++i) {
-    std::cout << bfs_test.reached.get(i) << " ";
-  }
-  std::cout<<std::endl;
-  std::cout << "dist: ";
-  for(EachNodeIt i=G.first<EachNodeIt>(); i.valid(); ++i) {
-    std::cout << bfs_test.dist.get(i) << " ";
-  }
-  std::cout<<std::endl;
-}
