From 017d65f57c8ae4597f846fd2e79902af3648230e Mon Sep 17 00:00:00 2001
From: Paul ALNET <alnet@insa-toulouse.fr>
Date: Tue, 21 May 2024 17:25:56 +0200
Subject: [PATCH] doc(test): mention optimality

---
 .../graphs/algorithm/shortestpath/ShortestPathAlgorithmTest.java | 1 +
 1 file changed, 1 insertion(+)

diff --git a/be-graphes-algos/src/test/java/org/insa/graphs/algorithm/shortestpath/ShortestPathAlgorithmTest.java b/be-graphes-algos/src/test/java/org/insa/graphs/algorithm/shortestpath/ShortestPathAlgorithmTest.java
index 1804555..19c3f0e 100644
--- a/be-graphes-algos/src/test/java/org/insa/graphs/algorithm/shortestpath/ShortestPathAlgorithmTest.java
+++ b/be-graphes-algos/src/test/java/org/insa/graphs/algorithm/shortestpath/ShortestPathAlgorithmTest.java
@@ -78,6 +78,7 @@ public abstract class ShortestPathAlgorithmTest {
 
     /*
      * 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) {
         final ShortestPathData data = new ShortestPathData(graph, origin, destination, arcFilter);