ysimard/be_graphes
1
0
分叉 0
程式碼 問題 合併請求 版本發布 Wiki 動態

Better tests for the square map

瀏覽代碼
這個提交存在於：
Yohan Simard 2020-05-31 20:26:42 +02:00
父節點 25e08fc7f0
當前提交 5e75797cda
共有 1 個檔案被更改，包括 12 行新增 和 6 行删除
顯示統計資料 下載補綴檔案 下載差異檔案 展開所有檔案 折疊所有檔案

18
be-graphes-algos/src/test/java/org/insa/graphs/algorithm/shortestpath/ShortestPathTest.java
查看文件

@ -66,15 +66,21 @@ public abstract class ShortestPathTest {
assertTrue(sol.isFeasible());
Path path = sol.getPath();
assertTrue(path.isValid());
// skip these tests for the square map where there may be several arcs with the same cost
// check the optimality locally
if (arcInspector == arcInspectors[0])
assertEquals(path, Path.createShortestPathFromNodes(data.getGraph(), path.getNodes()));
if (arcInspector == arcInspectors[1])
assertEquals(path, Path.createFastestPathFromNodes(data.getGraph(), path.getNodes()));
// skip this test for the square map where there may be several paths with the same cost
if (i != 0) {
// check the optimality locally
if (arcInspector == arcInspectors[0])
assertEquals(path, Path.createShortestPathFromNodes(data.getGraph(), path.getNodes()));
if (arcInspector == arcInspectors[1])
assertEquals(path, Path.createFastestPathFromNodes(data.getGraph(), path.getNodes()));
// Check result against Bellman Ford algorithm
assertEquals(sol.getPath(), oracle.getPath());
} else { // in the square map case, compare only the costs
if (arcInspector == arcInspectors[0])
assertEquals(sol.getPath().getLength(), oracle.getPath().getLength(), 1e-5);
if (arcInspector == arcInspectors[1])
assertEquals(sol.getPath().getMinimumTravelTime(), oracle.getPath().getMinimumTravelTime(), 1e-1);
}
}
}