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/be-graphes-model/src/main/java/org/insa/graphs/model/Path.java b/be-graphes-model/src/main/java/org/insa/graphs/model/Path.java index 7580981..c6ce978 100644 --- a/be-graphes-model/src/main/java/org/insa/graphs/model/Path.java +++ b/be-graphes-model/src/main/java/org/insa/graphs/model/Path.java @@ -195,11 +195,13 @@ public class Path { * Compute the length of this path (in meters). * * @return Total length of the path (in meters). - * @deprecated Need to be implemented. */ public float getLength() { - // TODO: - return 0; + float lg = 0; + for (Arc a : this.arcs) { + lg = lg + a.getLength(); + } + return lg; } /**