# HG changeset patch
# User marci
# Date 1093260506 0
# Node ID 6387df9aadb023b39d40e313a577d88e22987831
# Parent  eb61fbc64c16154488da6f3843f6c748b2a62c85
.

diff -r eb61fbc64c16 -r 6387df9aadb0 src/work/marci/leda/comparison.cc
--- a/src/work/marci/leda/comparison.cc	Mon Aug 23 11:26:09 2004 +0000
+++ b/src/work/marci/leda/comparison.cc	Mon Aug 23 11:28:26 2004 +0000
@@ -20,6 +20,7 @@
 #include <hugo/maps.h>
 #include <hugo/max_flow.h>
 
+using std::cin;
 using std::cout;
 using std::endl;
 
@@ -47,17 +48,17 @@
 
   int a;
   cout << "number of nodes in the first color class=";
-  std::cin >> a; 
+  cin >> a; 
   int b;
   cout << "number of nodes in the second color class=";
-  std::cin >> b; 
+  cin >> b; 
   int m;
   cout << "number of edges=";
-  std::cin >> m; 
+  cin >> m; 
   int k;
   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";
   cout << "number of groups in LEDA random group graph=";
-  std::cin >> k; 
+  cin >> k; 
   cout << endl;
   
   leda_list<leda_node> lS;