diff -r 9c0ce0a1f000 -r 4cbfb435ec2b src/work/marci/bipartite_matching_try_3.cc
--- a/src/work/marci/bipartite_matching_try_3.cc	Thu May 06 17:01:31 2004 +0000
+++ b/src/work/marci/bipartite_matching_try_3.cc	Thu May 06 17:22:11 2004 +0000
@@ -2,7 +2,6 @@
 #include <iostream>
 #include <fstream>
 #include <vector>
-#include <cstdlib>
 
 #include <list_graph.h>
 //#include <smart_graph.h>
@@ -13,6 +12,7 @@
 #include <bipartite_graph_wrapper.h>
 #include <hugo/maps.h>
 #include <max_flow.h>
+#include <graph_gen.h>
 
 using namespace hugo;
 
@@ -79,27 +79,6 @@
   int matchingValue() { return mf.flowValue(); }
 };
 
-/**
- * Inicializalja a veletlenszamgeneratort.
- * Figyelem, ez nem jo igazi random szamokhoz,
- * erre ne bizzad a titkaidat!
- */
-void random_init()
-{
-	unsigned int seed = getpid();
-	seed |= seed << 15;
-	seed ^= time(0);
-
-	srand(seed);
-}
-
-/**
- * Egy veletlen int-et ad vissza 0 es m-1 kozott.
- */
-int random(int m)
-{
-  return int( double(m) * rand() / (RAND_MAX + 1.0) );
-}
 
 int main() {
   //typedef UndirListGraph Graph; 
@@ -113,9 +92,6 @@
 
   Graph g;
 
-  std::vector<Graph::Node> s_nodes;
-  std::vector<Graph::Node> t_nodes;
-
   int a;
   std::cout << "number of nodes in the first color class=";
   std::cin >> a; 
@@ -127,13 +103,8 @@
   std::cin >> m; 
   
   std::cout << "Generatig a random bipartite graph..." << std::endl;
-  for (int i=0; i<a; ++i) s_nodes.push_back(g.addNode(false));
-  for (int i=0; i<b; ++i) t_nodes.push_back(g.addNode(true));
-
   random_init();
-  for(int i=0; i<m; ++i) {
-    g.addEdge(s_nodes[random(a)], t_nodes[random(b)]);
-  }
+  randomBipartiteGraph(g, a, b, m);
 
 //   std::cout << "Edges of the bipartite graph:" << std::endl;
 //   FOR_EACH_LOC(EdgeIt, e, g) std::cout << e << " ";