40 vector<Node> aNodes; |
40 vector<Node> aNodes; |
41 vector<Node> bNodes; |
41 vector<Node> bNodes; |
42 vector<LGraph::Node> laNodes; |
42 vector<LGraph::Node> laNodes; |
43 vector<LGraph::Node> lbNodes; |
43 vector<LGraph::Node> lbNodes; |
44 |
44 |
45 for (int i = 0; i < n; ++i) { |
45 for (int j = 0; j < n; ++j) { |
46 Node node = graph.addANode(); |
46 Node node = graph.addANode(); |
47 aNodes.push_back(node); |
47 aNodes.push_back(node); |
48 LGraph::Node lnode = lgraph.addANode(); |
48 LGraph::Node lnode = lgraph.addANode(); |
49 laNodes.push_back(lnode); |
49 laNodes.push_back(lnode); |
50 } |
50 } |
51 for (int i = 0; i < m; ++i) { |
51 for (int j = 0; j < m; ++j) { |
52 Node node = graph.addBNode(); |
52 Node node = graph.addBNode(); |
53 bNodes.push_back(node); |
53 bNodes.push_back(node); |
54 LGraph::Node lnode = lgraph.addBNode(); |
54 LGraph::Node lnode = lgraph.addBNode(); |
55 lbNodes.push_back(lnode); |
55 lbNodes.push_back(lnode); |
56 } |
56 } |
57 for (int i = 0; i < e; ++i) { |
57 for (int j = 0; j < e; ++j) { |
58 int a,b; |
58 int a,b; |
59 Node aNode = aNodes[a=rnd[n]]; |
59 Node aNode = aNodes[a=rnd[n]]; |
60 Node bNode = bNodes[b=rnd[m]]; |
60 Node bNode = bNodes[b=rnd[m]]; |
61 graph.addEdge(aNode, bNode); |
61 graph.addEdge(aNode, bNode); |
62 LGraph::Node laNode = laNodes[a]; |
62 LGraph::Node laNode = laNodes[a]; |