Home
last modified time | relevance | path

Searched refs:graphAsMutableGraph (Results 1 – 10 of 10) sorted by relevance

/external/guava/guava-tests/test/com/google/common/graph/
DAbstractStandardDirectedGraphTest.java351 assertThat(graphAsMutableGraph.putEdge(N1, N2)).isTrue(); in putEdge_existingNodes()
358 assertThat(graphAsMutableGraph.putEdge(N1, N2)).isTrue(); in putEdge_existingEdgeBetweenSameNodes()
359 assertThat(graphAsMutableGraph.putEdge(N1, N2)).isFalse(); in putEdge_existingEdgeBetweenSameNodes()
368 graphAsMutableGraph.putEdge(endpoints); in putEdge_orderMismatch()
384 graphAsMutableGraph.addNode(N1); in putEdge_nodesNotInGraph()
385 assertTrue(graphAsMutableGraph.putEdge(N1, N5)); in putEdge_nodesNotInGraph()
386 assertTrue(graphAsMutableGraph.putEdge(N4, N1)); in putEdge_nodesNotInGraph()
387 assertTrue(graphAsMutableGraph.putEdge(N2, N3)); in putEdge_nodesNotInGraph()
402 graphAsMutableGraph.putEdge(N1, N1); in putEdge_doesntAllowSelfLoops()
414 assertThat(graphAsMutableGraph.putEdge(N1, N1)).isTrue(); in putEdge_allowsSelfLoops()
[all …]
DAbstractGraphTest.java58 MutableGraph<Integer> graphAsMutableGraph; field in AbstractGraphTest
94 return graphAsMutableGraph != null; in graphIsMutable()
101 graphAsMutableGraph = (MutableGraph<Integer>) graph; in init()
353 assertThat(graphAsMutableGraph.addNode(N1)).isTrue(); in addNode_newNode()
363 assertThat(graphAsMutableGraph.addNode(N1)).isFalse(); in addNode_existingNode()
373 assertThat(graphAsMutableGraph.removeNode(N1)).isTrue(); in removeNode_existingNode()
374 assertThat(graphAsMutableGraph.removeNode(N1)).isFalse(); in removeNode_existingNode()
387 assertThat(graphAsMutableGraph.removeNode(N1)).isTrue(); in removeNode_antiparallelEdges()
391 assertThat(graphAsMutableGraph.removeNode(N2)).isTrue(); in removeNode_antiparallelEdges()
402 assertThat(graphAsMutableGraph.removeNode(NODE_NOT_IN_GRAPH)).isFalse(); in removeNode_nodeNotPresent()
[all …]
DAbstractStandardUndirectedGraphTest.java345 assertThat(graphAsMutableGraph.putEdge(N1, N2)).isTrue(); in putEdge_existingNodes()
354 assertThat(graphAsMutableGraph.putEdge(N2, N1)).isFalse(); in putEdge_existingEdgeBetweenSameNodes()
366 graphAsMutableGraph.addNode(N1); in putEdge_nodesNotInGraph()
367 assertTrue(graphAsMutableGraph.putEdge(N1, N5)); in putEdge_nodesNotInGraph()
368 assertTrue(graphAsMutableGraph.putEdge(N4, N1)); in putEdge_nodesNotInGraph()
369 assertTrue(graphAsMutableGraph.putEdge(N2, N3)); in putEdge_nodesNotInGraph()
396 assertThat(graphAsMutableGraph.putEdge(N1, N1)).isTrue(); in putEdge_allowsSelfLoops()
406 assertThat(graphAsMutableGraph.putEdge(N1, N1)).isFalse(); in putEdge_existingSelfLoopEdgeBetweenSameNodes()
416 assertThat(graphAsMutableGraph.removeEdge(N1, N2)).isTrue(); in removeEdge_antiparallelEdges()
419 assertThat(graphAsMutableGraph.removeEdge(N2, N1)).isFalse(); in removeEdge_antiparallelEdges()
[all …]
DStandardMutableUndirectedGraphTest.java60 graphAsMutableGraph.addNode(n); in addNode()
65 graphAsMutableGraph.putEdge(n1, n2); in putEdge()
DStandardMutableDirectedGraphTest.java60 graphAsMutableGraph.addNode(n); in addNode()
65 graphAsMutableGraph.putEdge(n1, n2); in putEdge()
/external/guava/android/guava-tests/test/com/google/common/graph/
DAbstractStandardDirectedGraphTest.java351 assertThat(graphAsMutableGraph.putEdge(N1, N2)).isTrue(); in putEdge_existingNodes()
358 assertThat(graphAsMutableGraph.putEdge(N1, N2)).isTrue(); in putEdge_existingEdgeBetweenSameNodes()
359 assertThat(graphAsMutableGraph.putEdge(N1, N2)).isFalse(); in putEdge_existingEdgeBetweenSameNodes()
368 graphAsMutableGraph.putEdge(endpoints); in putEdge_orderMismatch()
384 graphAsMutableGraph.addNode(N1); in putEdge_nodesNotInGraph()
385 assertTrue(graphAsMutableGraph.putEdge(N1, N5)); in putEdge_nodesNotInGraph()
386 assertTrue(graphAsMutableGraph.putEdge(N4, N1)); in putEdge_nodesNotInGraph()
387 assertTrue(graphAsMutableGraph.putEdge(N2, N3)); in putEdge_nodesNotInGraph()
402 graphAsMutableGraph.putEdge(N1, N1); in putEdge_doesntAllowSelfLoops()
414 assertThat(graphAsMutableGraph.putEdge(N1, N1)).isTrue(); in putEdge_allowsSelfLoops()
[all …]
DAbstractGraphTest.java58 MutableGraph<Integer> graphAsMutableGraph; field in AbstractGraphTest
94 return graphAsMutableGraph != null; in graphIsMutable()
101 graphAsMutableGraph = (MutableGraph<Integer>) graph; in init()
353 assertThat(graphAsMutableGraph.addNode(N1)).isTrue(); in addNode_newNode()
363 assertThat(graphAsMutableGraph.addNode(N1)).isFalse(); in addNode_existingNode()
373 assertThat(graphAsMutableGraph.removeNode(N1)).isTrue(); in removeNode_existingNode()
374 assertThat(graphAsMutableGraph.removeNode(N1)).isFalse(); in removeNode_existingNode()
387 assertThat(graphAsMutableGraph.removeNode(N1)).isTrue(); in removeNode_antiparallelEdges()
391 assertThat(graphAsMutableGraph.removeNode(N2)).isTrue(); in removeNode_antiparallelEdges()
402 assertThat(graphAsMutableGraph.removeNode(NODE_NOT_IN_GRAPH)).isFalse(); in removeNode_nodeNotPresent()
[all …]
DAbstractStandardUndirectedGraphTest.java345 assertThat(graphAsMutableGraph.putEdge(N1, N2)).isTrue(); in putEdge_existingNodes()
354 assertThat(graphAsMutableGraph.putEdge(N2, N1)).isFalse(); in putEdge_existingEdgeBetweenSameNodes()
366 graphAsMutableGraph.addNode(N1); in putEdge_nodesNotInGraph()
367 assertTrue(graphAsMutableGraph.putEdge(N1, N5)); in putEdge_nodesNotInGraph()
368 assertTrue(graphAsMutableGraph.putEdge(N4, N1)); in putEdge_nodesNotInGraph()
369 assertTrue(graphAsMutableGraph.putEdge(N2, N3)); in putEdge_nodesNotInGraph()
396 assertThat(graphAsMutableGraph.putEdge(N1, N1)).isTrue(); in putEdge_allowsSelfLoops()
406 assertThat(graphAsMutableGraph.putEdge(N1, N1)).isFalse(); in putEdge_existingSelfLoopEdgeBetweenSameNodes()
416 assertThat(graphAsMutableGraph.removeEdge(N1, N2)).isTrue(); in removeEdge_antiparallelEdges()
419 assertThat(graphAsMutableGraph.removeEdge(N2, N1)).isFalse(); in removeEdge_antiparallelEdges()
[all …]
DStandardMutableUndirectedGraphTest.java60 graphAsMutableGraph.addNode(n); in addNode()
65 graphAsMutableGraph.putEdge(n1, n2); in putEdge()
DStandardMutableDirectedGraphTest.java60 graphAsMutableGraph.addNode(n); in addNode()
65 graphAsMutableGraph.putEdge(n1, n2); in putEdge()