# HG changeset patch
# User marci
# Date 1083075433 0
# Node ID 9c997ebe4aff8df9ddd3752fa8aba1720d9698c5
# Parent  77ef5c7a57d96adff1b54c10a521b9e305b29c21
misc

diff -r 77ef5c7a57d9 -r 9c997ebe4aff src/work/marci/leda/bipartite_matching_leda_gen.cc
--- a/src/work/marci/leda/bipartite_matching_leda_gen.cc	Tue Apr 27 14:10:19 2004 +0000
+++ b/src/work/marci/leda/bipartite_matching_leda_gen.cc	Tue Apr 27 14:17:13 2004 +0000
@@ -75,6 +75,7 @@
   std::cout << "number of edges=";
   std::cin >> m; 
   int k;
+  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";
   std::cout << "number of groups in LEDA random group graph=";
   std::cin >> k;