@Test
public void returnFalseIfNodeAIsNOtReachableFromD() {
graph.addEdge(a, b);
graph.addEdge(c, d);
assertFalse(graph.isReachable(a, d));
}
@Test
public void returnTrueIfNodeAIsReachableFromDWithCycle() {
graph.addEdge(a, b);
graph.addEdge(b, d);
graph.addEdge(d, a);
graph.addEdge(a, c);
List<Node> visited = new ArrayList<>();
assertTrue(graph.isReachable(a, c));
}
@Test
public void returnTrueIfNodeAIsReachableFromDWithoutCycle() {
graph.addEdge(a, b);
graph.addEdge(b, d);
graph.addEdge(d, a);
graph.addEdge(a, c);
assertTrue(graph.isReachable(a, c));
assertTrue(graph.isReachable(a, c));
}
@Test
public void returnTrueIfNodeAIsReachable() {
graph.addEdge(a, b);
graph.addEdge(b, c);
assertTrue(graph.isReachable(a, c));
}
@Test
public void returnTrueIfNodeAIsNeighbourOfNodeB() {
graph.addEdge(a, b);
assertTrue(graph.isReachable(a, b));
}
@Test
public void nodeIsSelfReachable() {
Graph graph = new Graph(nodes, adjacencyList);
assertTrue(graph.isReachable(a, a));
}
