lacau/BE_Graphes
1
0
Fork 0
Code Issues Pull requests Releases Wiki Activity

doc(test): mention optimality

Browse source
This commit is contained in:
Paul Alnet 2024-05-21 17:25:56 +02:00
parent e4c6f656f9
commit 017d65f57c
1 changed files with 1 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

1
be-graphes-algos/src/test/java/org/insa/graphs/algorithm/shortestpath/ShortestPathAlgorithmTest.java
View file

@ -78,6 +78,7 @@ public abstract class ShortestPathAlgorithmTest {
/* /*
* Verifies that path is valid and matches the one found by the Bellman algo * Verifies that path is valid and matches the one found by the Bellman algo
* Otherwise the algo in not optimal.
*/ */
private void assertBellmanHasSameResult(Graph graph, Node origin, Node destination, ArcInspector arcFilter) { private void assertBellmanHasSameResult(Graph graph, Node origin, Node destination, ArcInspector arcFilter) {
final ShortestPathData data = new ShortestPathData(graph, origin, destination, arcFilter); final ShortestPathData data = new ShortestPathData(graph, origin, destination, arcFilter);