1.1 --- a/src/work/athos/uf_demo.cc	Sun Apr 17 18:57:22 2005 +0000
     1.2 +++ /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.3 @@ -1,48 +0,0 @@
     1.4 -//This is just a simple example program to test my union-find structure
     1.5 -
     1.6 -//#include <marciMap.hh>
     1.7 -#include <union_find.h>
     1.8 -#include <iostream>
     1.9 -#include <list_graph.hh>
    1.10 -using namespace lemon;
    1.11 -using namespace std;
    1.12 -
    1.13 -int main (int, char*[])
    1.14 -{
    1.15 -  typedef ListGraph::NodeIt NodeIt;
    1.16 -  typedef ListGraph::EachNodeIt EachNodeIt;
    1.17 -  typedef ListGraph::EdgeIt EdgeIt;
    1.18 -
    1.19 -  ListGraph flowG;
    1.20 -
    1.21 -  
    1.22 -  //Marci példája
    1.23 -
    1.24 -
    1.25 -
    1.26 -  NodeIt s=flowG.addNode();
    1.27 -  NodeIt v1=flowG.addNode();
    1.28 -  NodeIt v2=flowG.addNode();
    1.29 -  NodeIt v3=flowG.addNode();
    1.30 -  NodeIt v4=flowG.addNode();
    1.31 -  NodeIt t=flowG.addNode();
    1.32 -
    1.33 -  ListGraph::NodeMap<int> component(flowG);
    1.34 -
    1.35 -  component.set(s, -1);
    1.36 -  component.set(v1, -1);
    1.37 -  component.set(v2, -1);
    1.38 -  component.set(v3, -1);
    1.39 -  component.set(v4, -1);
    1.40 -  component.set(t, -1);
    1.41 -
    1.42 -  UnionFind< NodeIt, ListGraph::NodeMap<int> > uf(component);
    1.43 -  cout<<"Merge s and v1: "<<uf.findAndMerge(s,v1)<<endl;
    1.44 -  cout<<"Merge s and v1: "<<uf.findAndMerge(s,v1)<<endl;
    1.45 -  cout<<"Merge s and v2: "<<uf.findAndMerge(s,v3)<<endl;
    1.46 -  for(EachNodeIt i=flowG.template first<EachNodeIt>(); i.valid(); ++i) {
    1.47 -
    1.48 -    cout<<"Az "<<flowG.id(i)<<". pont itt van: "<<uf.find(i)<<endl;
    1.49 -    //std::cout << node_name.get(i) << ": ";
    1.50 -  }
    1.51 -}