Lines Matching refs:addEdge
103 void addEdge(Node* dependedOn, Node* dependent) { in addEdge() function in Graph
334 g.addEdge(nodeD, nodeR); in test_1()
335 g.addEdge(nodeZ, nodeW); in test_1()
336 g.addEdge(nodeA, nodeB); in test_1()
337 g.addEdge(nodeY, nodeZ); in test_1()
338 g.addEdge(nodeQ, nodeA); in test_1()
348 g.addEdge(nodeX, nodeY); in test_1()
374 g.addEdge(nodeU, nodeX); in test_2()
375 g.addEdge(nodeW, nodeU); in test_2()
376 g.addEdge(nodeW, nodeZ); in test_2()
377 g.addEdge(nodeY, nodeZ); in test_2()
387 g.addEdge(nodeX, nodeY); in test_2()
397 g.addEdge(nodeV, nodeW); in test_2()
434 g.addEdge(nodeA, nodeB); // node A must come before node B in test_diamond()
435 g.addEdge(nodeA, nodeC); // node A must come before node C in test_diamond()
471 g.addEdge(nodeE, nodeG); in test_lopsided_binary_tree()
472 g.addEdge(nodeE, nodeF); in test_lopsided_binary_tree()
473 g.addEdge(nodeC, nodeE); in test_lopsided_binary_tree()
474 g.addEdge(nodeC, nodeD); in test_lopsided_binary_tree()
475 g.addEdge(nodeA, nodeC); in test_lopsided_binary_tree()
476 g.addEdge(nodeA, nodeB); in test_lopsided_binary_tree()