Index: src/work/marci/bipartite_graph_wrapper.h
===================================================================
--- src/work/marci/bipartite_graph_wrapper.h	(revision 500)
+++ src/work/marci/bipartite_graph_wrapper.h	(revision 501)
@@ -32,5 +32,6 @@
     SFalseTTrueMap* s_false_t_true_map;
 
-    BipartiteGraphWrapper() : GraphWrapper<Graph>() { }
+    BipartiteGraphWrapper() : GraphWrapper<Graph>()/*, 
+						     S_CLASS(false), T_CLASS(true)*/ { }
     void setSFalseTTrueMap(SFalseTTrueMap& _s_false_t_true_map) { 
       s_false_t_true_map=&_s_false_t_true_map;
@@ -40,14 +41,14 @@
     //marci
     //FIXME vhogy igy kellene, csak az en forditom nem eszi meg
-    //static const bool S_CLASS=false;
-    //static const bool T_CLASS=true;
+    static const bool S_CLASS=false;
+    static const bool T_CLASS=true;
     
-    bool S_CLASS;
-    bool T_CLASS;
+    //bool S_CLASS;
+    //bool T_CLASS;
 
     BipartiteGraphWrapper(Graph& _graph, SFalseTTrueMap& _s_false_t_true_map) 
       : GraphWrapper<Graph>(_graph), 
-	s_false_t_true_map(&_s_false_t_true_map), 
-	S_CLASS(false), T_CLASS(true) { }
+	s_false_t_true_map(&_s_false_t_true_map)/*, 
+						  S_CLASS(false), T_CLASS(true)*/ { }
     typedef typename GraphWrapper<Graph>::Node Node;
     //using GraphWrapper<Graph>::NodeIt;
@@ -210,4 +211,5 @@
       Node n=Parent::graph->addNode();
       bipartite_map.update();
+      //bipartite_map.set(n, -1);
       s_false_t_true_map.insert(n, b);
       return n;
Index: src/work/marci/bipartite_matching_try_2.cc
===================================================================
--- src/work/marci/bipartite_matching_try_2.cc	(revision 500)
+++ src/work/marci/bipartite_matching_try_2.cc	(revision 501)
@@ -77,9 +77,12 @@
   std::cout << std::endl;
 
+  std::cout << "Nodes:" << std::endl;
+  FOR_EACH_LOC(Graph::NodeIt, v, g) std::cout << v << " ";
+  std::cout << std::endl;
   std::cout << "Nodes in T:" << std::endl;
-  FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, g.T_CLASS) std::cout << v << " ";
+  FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, Graph::T_CLASS) std::cout << v << " ";
   std::cout << std::endl;
   std::cout << "Nodes in S:" << std::endl;
-  FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, g.S_CLASS) std::cout << v << " ";
+  FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, Graph::S_CLASS) std::cout << v << " ";
   std::cout << std::endl;
 
@@ -93,8 +96,8 @@
 
   std::cout << "Nodes in T:" << std::endl;
-  FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, g.T_CLASS) std::cout << v << " ";
+  FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, Graph::T_CLASS) std::cout << v << " ";
   std::cout << std::endl;
   std::cout << "Nodes in S:" << std::endl;
-  FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, g.S_CLASS) std::cout << v << " ";
+  FOR_EACH_INC_LOC(Graph::ClassNodeIt, v, g, Graph::S_CLASS) std::cout << v << " ";
   std::cout << std::endl;