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..27561e2 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 @@ -30,7 +30,8 @@ public class Path { public static Path createFastestPathFromNodes(Graph graph, List nodes) throws IllegalArgumentException { List arcs = new ArrayList(); - // TODO: + // TODO : faut faire en fct du maxspeed ds road information + return new Path(graph, arcs); } @@ -198,8 +199,11 @@ public class Path { * @deprecated Need to be implemented. */ public float getLength() { - // TODO: - return 0; + float pathLength=0f; // sinon error si on met O.O + for (Arc element : this.arcs) { + pathLength=pathLength+((float) element.getLength()); + } + return pathLength; } /**