1.1 --- a/src/work/marci/leda/comparison.cc	Mon Aug 23 11:26:09 2004 +0000
     1.2 +++ b/src/work/marci/leda/comparison.cc	Mon Aug 23 11:28:26 2004 +0000
     1.3 @@ -20,6 +20,7 @@
     1.4  #include <hugo/maps.h>
     1.5  #include <hugo/max_flow.h>
     1.6  
     1.7 +using std::cin;
     1.8  using std::cout;
     1.9  using std::endl;
    1.10  
    1.11 @@ -47,17 +48,17 @@
    1.12  
    1.13    int a;
    1.14    cout << "number of nodes in the first color class=";
    1.15 -  std::cin >> a; 
    1.16 +  cin >> a; 
    1.17    int b;
    1.18    cout << "number of nodes in the second color class=";
    1.19 -  std::cin >> b; 
    1.20 +  cin >> b; 
    1.21    int m;
    1.22    cout << "number of edges=";
    1.23 -  std::cin >> m; 
    1.24 +  cin >> m; 
    1.25    int k;
    1.26    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";
    1.27    cout << "number of groups in LEDA random group graph=";
    1.28 -  std::cin >> k; 
    1.29 +  cin >> k; 
    1.30    cout << endl;
    1.31    
    1.32    leda_list<leda_node> lS;