Lines Matching refs:node
45 final TestNode node = new TestNode("node");
46 mGraph.addNode(node);
48 assertTrue(mGraph.contains(node));
53 final TestNode node = new TestNode("node");
54 mGraph.addNode(node);
55 mGraph.addNode(node);
58 assertTrue(mGraph.contains(node));
63 final TestNode node = new TestNode("node");
66 mGraph.addNode(node);
68 mGraph.addEdge(node, edge);
73 final TestNode node = new TestNode("node");
76 // Add the node, but not the edge node
77 mGraph.addNode(node);
80 mGraph.addEdge(node, edge);
85 final TestNode node = new TestNode("node");
87 mGraph.addNode(node);
89 mGraph.addEdge(node, edge);
91 final List<TestNode> incomingEdges = mGraph.getIncomingEdges(node);
99 final TestNode node = new TestNode("node");
101 mGraph.addNode(node);
103 mGraph.addEdge(node, edge);
105 // Now assert the getOutgoingEdges returns a list which has one element (node)
109 assertTrue(outgoingEdges.contains(node));
134 final TestNode node = new TestNode("node");
136 mGraph.addNode(node);
142 mGraph.addEdge(node, edge);