COIN-OR::LEMON - Graph Library

Changeset 447:9c997ebe4aff in lemon-0.x


Ignore:
Timestamp:
04/27/04 16:17:13 (16 years ago)
Author:
marci
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@595
Message:

misc

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/work/marci/leda/bipartite_matching_leda_gen.cc

    r446 r447  
    7676  std::cin >> m;
    7777  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_{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";
    7879  std::cout << "number of groups in LEDA random group graph=";
    7980  std::cin >> k;
Note: See TracChangeset for help on using the changeset viewer.