jacint@1058: #include <iostream>
jacint@1058: #include <queue>
jacint@1058: #include <vector>
jacint@1058: #include <math.h>
jacint@1058: 
jacint@1058: #include <lemon/invalid.h>
jacint@1058: #include <lemon/list_graph.h>
klao@1060: #include <lemon/smart_graph.h>
jacint@1058: #include <matching.h>
jacint@1058: 
jacint@1058: using namespace lemon;
klao@1060: using namespace std;
jacint@1058: 
jacint@1058: 
klao@1060: int main() {
klao@1060: 
klao@1060:   typedef UndirSmartGraph Graph;
jacint@1058: 
jacint@1058:   typedef Graph::Edge Edge;
jacint@1058:   typedef Graph::UndirEdgeIt UndirEdgeIt;
jacint@1058:   typedef Graph::IncEdgeIt IncEdgeIt;
jacint@1058:   typedef Graph::NodeIt NodeIt;
jacint@1058:   typedef Graph::Node Node;
klao@1060: 
klao@1060:   typedef Graph::OutEdgeIt OutEdgeIt;
jacint@1058:    
jacint@1058:   Graph G;
jacint@1058: 
klao@1060:   // G.clear();
jacint@1058:   std::vector<Graph::Node> nodes;
jacint@1058:   for (int i=0; i<5; ++i)
jacint@1058:       nodes.push_back(G.addNode());
jacint@1058:   G.addEdge(nodes[0], nodes[0]);
jacint@1058:   G.addEdge(nodes[0], nodes[1]);
jacint@1058:   G.addEdge(nodes[0], nodes[2]);  
jacint@1058:   G.addEdge(nodes[0], nodes[4]);
jacint@1058:   G.addEdge(nodes[2], nodes[3]);
jacint@1058:   G.addEdge(nodes[1], nodes[2]);
jacint@1058:   G.addEdge(nodes[2], nodes[4]);
jacint@1058: 
jacint@1058:   for(UndirEdgeIt e(G); e!=INVALID; ++e) {
klao@1060:     std::cout<<G.id(e)<<" : "<<G.id(G.source(e))
klao@1060: 	     <<" " <<G.id(G.target(e))<<std::endl;
jacint@1058:   }
jacint@1058: 
jacint@1058:   std::cout <<"Nodes:"<<std::endl;
jacint@1058: 
jacint@1058:   for(NodeIt v(G); v!=INVALID; ++v) {
jacint@1058:     std::cout<<G.id(v)<<std::endl;
jacint@1058:   }
jacint@1058: 
klao@1060:   cout << "Dev Out edges from node " << G.id(nodes[1])<<std::endl;
klao@1060:   Edge f;
klao@1060:   for(G.firstOut(f, nodes[1]); f!=INVALID; G.nextOut(f)) {
klao@1060:     cout<<"edge " << G.id(f) << " goes"
klao@1060: 	     <<" from "<< G.id(G.source(f)) 
klao@1060: 	     << " to " << G.id(G.target(f))<<std::endl;
klao@1060:   }
klao@1060: 
klao@1060:   cout << "Out edges from node " << G.id(nodes[1])<<std::endl;
klao@1060:   for( OutEdgeIt f(G,nodes[1]); f!=INVALID; ++f ) {
klao@1060:     cout<<"edge " << G.id(f) << " goes"
klao@1060: 	     <<" from "<< G.id(G.source(f)) 
klao@1060: 	     << " to " << G.id(G.target(f))<<std::endl;
klao@1060:   }
klao@1060: 
jacint@1059:   std::cout<<"Edges of node " << G.id(nodes[1])<<std::endl;
klao@1060:   for( IncEdgeIt f(G,nodes[1]); f!=INVALID; ++f ) {
klao@1060:     cout<<"edge " << G.id(f) << " goes"
klao@1060: 	     <<" from "<< G.id(G.source(f)) 
klao@1060: 	     << " to " << G.id(G.target(f))<<std::endl;
klao@1060:   }
jacint@1059: 
klao@1060:   //return 0;
klao@1060: 
klao@1060:   //ez a ket for ciklus meg lefut - bar hibas eleken iteral -, de a
klao@1060:   //matching.h-s mar segfaultol
jacint@1058: 
jacint@1058:   for( IncEdgeIt f(G,nodes[1]); f!=INVALID; ++f ) {
jacint@1059:     std::cout<<"edge " << G.id(f)<< " goes to " << G.id(G.target(f))<<std::endl;
jacint@1058:   }
jacint@1058: 
jacint@1058:   MaxMatching<Graph> max_matching(G);
jacint@1058:   max_matching.runEdmonds(0);
jacint@1058:   
jacint@1058:   return 0;
jacint@1058: }
jacint@1058: