Changeset 447:9c997ebe4aff in lemon0.x for src/work/marci/leda/bipartite_matching_leda_gen.cc
 Timestamp:
 04/27/04 16:17:13 (19 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@595
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

src/work/marci/leda/bipartite_matching_leda_gen.cc
r446 r447 76 76 std::cin >> m; 77 77 int k; 78 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_{k1} and B_0, B_1, ..., B_{k1} \nas equally as possible \nand the edges from A_i goes to A_{i1 mod k} and A_{i+1 mod k}.\n"; 78 79 std::cout << "number of groups in LEDA random group graph="; 79 80 std::cin >> k;
Note: See TracChangeset
for help on using the changeset viewer.