|
@@ -64,7 +64,7 @@ public class DAGTest {
|
|
|
graph.addNode(i, "v(" + i + ")");
|
|
|
}
|
|
|
|
|
|
-
|
|
|
+
|
|
|
assertTrue(graph.addEdge(1, 2));
|
|
|
|
|
|
assertTrue(graph.addEdge(2, 5));
|
|
@@ -84,7 +84,7 @@ public class DAGTest {
|
|
|
|
|
|
|
|
|
|
|
|
- * 测试增加顶点
|
|
|
+ * add node
|
|
|
*/
|
|
|
@Test
|
|
|
public void testAddNode() {
|
|
@@ -104,7 +104,7 @@ public class DAGTest {
|
|
|
|
|
|
|
|
|
|
|
|
- * 添加边
|
|
|
+ * add edge
|
|
|
*/
|
|
|
@Test
|
|
|
public void testAddEdge() {
|
|
@@ -129,7 +129,7 @@ public class DAGTest {
|
|
|
|
|
|
|
|
|
|
|
|
- * 测试后续结点
|
|
|
+ * add subsequent node
|
|
|
*/
|
|
|
@Test
|
|
|
public void testSubsequentNodes() {
|
|
@@ -141,7 +141,7 @@ public class DAGTest {
|
|
|
|
|
|
|
|
|
|
|
|
- * 测试入度
|
|
|
+ * test indegree
|
|
|
*/
|
|
|
@Test
|
|
|
public void testIndegree() {
|
|
@@ -155,7 +155,7 @@ public class DAGTest {
|
|
|
|
|
|
|
|
|
|
|
|
- * 测试起点
|
|
|
+ * test begin node
|
|
|
*/
|
|
|
@Test
|
|
|
public void testBeginNode() {
|
|
@@ -170,7 +170,7 @@ public class DAGTest {
|
|
|
|
|
|
|
|
|
|
|
|
- * 测试终点
|
|
|
+ * test end node
|
|
|
*/
|
|
|
@Test
|
|
|
public void testEndNode() {
|
|
@@ -183,18 +183,18 @@ public class DAGTest {
|
|
|
|
|
|
|
|
|
|
|
|
- * 测试环
|
|
|
+ * test cycle
|
|
|
*/
|
|
|
@Test
|
|
|
public void testCycle() {
|
|
|
clear();
|
|
|
|
|
|
-
|
|
|
+
|
|
|
for (int i = 1; i <= 5; ++i) {
|
|
|
graph.addNode(i, "v(" + i + ")");
|
|
|
}
|
|
|
|
|
|
-
|
|
|
+
|
|
|
try {
|
|
|
graph.addEdge(1, 2);
|
|
|
graph.addEdge(2, 3);
|
|
@@ -208,9 +208,9 @@ public class DAGTest {
|
|
|
|
|
|
|
|
|
try {
|
|
|
- boolean addResult = graph.addEdge(4, 1);
|
|
|
+ boolean addResult = graph.addEdge(4, 1);
|
|
|
|
|
|
- if(!addResult){
|
|
|
+ if(!addResult){
|
|
|
assertTrue(true);
|
|
|
}
|
|
|
|
|
@@ -222,15 +222,14 @@ public class DAGTest {
|
|
|
fail();
|
|
|
}
|
|
|
|
|
|
-
|
|
|
clear();
|
|
|
|
|
|
-
|
|
|
+
|
|
|
for (int i = 1; i <= 5; ++i) {
|
|
|
graph.addNode(i, "v(" + i +")");
|
|
|
}
|
|
|
|
|
|
-
|
|
|
+
|
|
|
try {
|
|
|
graph.addEdge(1, 2);
|
|
|
graph.addEdge(2, 3);
|
|
@@ -251,7 +250,8 @@ public class DAGTest {
|
|
|
makeGraph();
|
|
|
|
|
|
try {
|
|
|
- List<Integer> topoList = new ArrayList<>();
|
|
|
+
|
|
|
+ List<Integer> topoList = new ArrayList<>();
|
|
|
topoList.add(1);
|
|
|
topoList.add(3);
|
|
|
topoList.add(4);
|
|
@@ -276,10 +276,10 @@ public class DAGTest {
|
|
|
graph.addEdge(2, 3, null, true);
|
|
|
graph.addEdge(3, 4, null, true);
|
|
|
graph.addEdge(4, 5, null, true);
|
|
|
- graph.addEdge(5, 1, null, false);
|
|
|
+ graph.addEdge(5, 1, null, false);
|
|
|
|
|
|
try {
|
|
|
- List<Integer> topoList = new ArrayList<>();
|
|
|
+ List<Integer> topoList = new ArrayList<>();
|
|
|
topoList.add(1);
|
|
|
topoList.add(2);
|
|
|
topoList.add(3);
|
|
@@ -296,9 +296,6 @@ public class DAGTest {
|
|
|
}
|
|
|
|
|
|
|
|
|
-
|
|
|
- *
|
|
|
- */
|
|
|
@Test
|
|
|
public void testTopologicalSort3() throws Exception {
|
|
|
clear();
|
|
@@ -316,7 +313,7 @@ public class DAGTest {
|
|
|
graph.addNode(i, "v(" + i + ")");
|
|
|
}
|
|
|
|
|
|
-
|
|
|
+
|
|
|
assertTrue(graph.addEdge(1, 2));
|
|
|
|
|
|
assertTrue(graph.addEdge(1, 3));
|
|
@@ -345,9 +342,6 @@ public class DAGTest {
|
|
|
|
|
|
logger.info(i + " subsequentNodes : " + graph.getSubsequentNodes(i));
|
|
|
}
|
|
|
-
|
|
|
-
|
|
|
-
|
|
|
logger.info(6 + " previousNodesb: " + graph.getPreviousNodes(6));
|
|
|
assertEquals(5, graph.getSubsequentNodes(2).toArray()[0]);
|
|
|
|