COIN-OR::LEMON - Graph Library

Changeset 770:6387df9aadb0 in lemon-0.x


Ignore:
Timestamp:
08/23/04 13:28:26 (15 years ago)
Author:
marci
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1033
Message:

.

File:
1 edited

Legend:

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

    r769 r770  
    2121#include <hugo/max_flow.h>
    2222
     23using std::cin;
    2324using std::cout;
    2425using std::endl;
     
    4849  int a;
    4950  cout << "number of nodes in the first color class=";
    50   std::cin >> a;
     51  cin >> a;
    5152  int b;
    5253  cout << "number of nodes in the second color class=";
    53   std::cin >> b;
     54  cin >> b;
    5455  int m;
    5556  cout << "number of edges=";
    56   std::cin >> m;
     57  cin >> m;
    5758  int k;
    5859  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";
    5960  cout << "number of groups in LEDA random group graph=";
    60   std::cin >> k;
     61  cin >> k;
    6162  cout << endl;
    6263 
Note: See TracChangeset for help on using the changeset viewer.