equal
deleted
inserted
replaced
73 std::cin >> b; |
73 std::cin >> b; |
74 int m; |
74 int m; |
75 std::cout << "number of edges="; |
75 std::cout << "number of edges="; |
76 std::cin >> m; |
76 std::cin >> m; |
77 int k; |
77 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"; |
78 std::cout << "number of groups in LEDA random group graph="; |
79 std::cout << "number of groups in LEDA random group graph="; |
79 std::cin >> k; |
80 std::cin >> k; |
80 |
81 |
81 leda_list<leda_node> lS; |
82 leda_list<leda_node> lS; |
82 leda_list<leda_node> lT; |
83 leda_list<leda_node> lT; |