diff --git a/be-graphes-algos/src/test/java/org/insa/graphs/algorithm/utils/PriorityQueueTest.java b/be-graphes-algos/src/test/java/org/insa/graphs/algorithm/utils/PriorityQueueTest.java index 27bb14e..649875f 100644 --- a/be-graphes-algos/src/test/java/org/insa/graphs/algorithm/utils/PriorityQueueTest.java +++ b/be-graphes-algos/src/test/java/org/insa/graphs/algorithm/utils/PriorityQueueTest.java @@ -311,7 +311,8 @@ public abstract class PriorityQueueTest { Assume.assumeFalse(queue.isEmpty()); int min = Collections.min(Arrays.asList(parameters.data)).get(); for (MutableInteger mi : parameters.data) { - // Update value before removing it. This is what happens when updating a Dijkstra label before updating it. + // Update value before removing it. This is what happens when updating a + // Dijkstra label before updating it. mi.set(--min); queue.remove(mi); assertEquals(parameters.data.length - 1, queue.size()); diff --git a/explications.txt b/explications.txt new file mode 100644 index 0000000..94d4661 --- /dev/null +++ b/explications.txt @@ -0,0 +1,2 @@ +on implémente les graphes avec des listes d'adjacences car les graphes routiers sont planaires +