1.1 --- a/src/work/marci/leda/bipartite_matching_leda_gen.cc	Tue Apr 27 14:10:19 2004 +0000
     1.2 +++ b/src/work/marci/leda/bipartite_matching_leda_gen.cc	Tue Apr 27 14:17:13 2004 +0000
     1.3 @@ -75,6 +75,7 @@
     1.4    std::cout << "number of edges=";
     1.5    std::cin >> m; 
     1.6    int k;
     1.7 +  std::cout << "A bipartite graph is a random group graph if the color classes \nA and B are partitiones to A_0, A_1, ..., A_{k-1} and B_0, B_1, ..., B_{k-1} \nas equally as possible \nand the edges from A_i goes to A_{i-1 mod k} and A_{i+1 mod k}.\n";
     1.8    std::cout << "number of groups in LEDA random group graph=";
     1.9    std::cin >> k; 
    1.10