-
Notifications
You must be signed in to change notification settings - Fork 0
/
DepthFirstSearchTest.java
42 lines (39 loc) · 1.06 KB
/
DepthFirstSearchTest.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
package fundamentals.graph;
import org.junit.Assert;
import org.junit.Test;
/**
* The type Depth first search test.
*/
public class DepthFirstSearchTest {
/**
* Test reachable
*/
@Test
public void testMarked() {
Graph G = Graph.getTestGraphWithData();
//0 as the start vertex
DepthFirstSearch dfs = new DepthFirstSearch(G, 0);
Assert.assertFalse(dfs.marked(7));
Assert.assertFalse(dfs.marked(8));
Assert.assertFalse(dfs.marked(9));
Assert.assertFalse(dfs.marked(10));
Assert.assertFalse(dfs.marked(11));
Assert.assertFalse(dfs.marked(12));
Assert.assertTrue(dfs.marked(1));
Assert.assertTrue(dfs.marked(2));
Assert.assertTrue(dfs.marked(3));
Assert.assertTrue(dfs.marked(4));
Assert.assertTrue(dfs.marked(5));
Assert.assertTrue(dfs.marked(6));
}
/**
* Test count of reachable vertex .
*/
@Test
public void testCount() {
Graph G = Graph.getTestGraphWithData();
//0 as the start vertex
DepthFirstSearch dfs = new DepthFirstSearch(G, 0);
Assert.assertEquals(7, dfs.count());
}
}