Changeset 770:6387df9aadb0 in lemon0.x for src/work
 Timestamp:
 08/23/04 13:28:26 (20 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@1033
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

src/work/marci/leda/comparison.cc
r769 r770 21 21 #include <hugo/max_flow.h> 22 22 23 using std::cin; 23 24 using std::cout; 24 25 using std::endl; … … 48 49 int a; 49 50 cout << "number of nodes in the first color class="; 50 std::cin >> a;51 cin >> a; 51 52 int b; 52 53 cout << "number of nodes in the second color class="; 53 std::cin >> b;54 cin >> b; 54 55 int m; 55 56 cout << "number of edges="; 56 std::cin >> m;57 cin >> m; 57 58 int k; 58 59 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"; 59 60 cout << "number of groups in LEDA random group graph="; 60 std::cin >> k;61 cin >> k; 61 62 cout << endl; 62 63
Note: See TracChangeset
for help on using the changeset viewer.