feat(path): implement getShortestPathFromNodes

be-graphes-model/src/main/java/org/insa/graphs/model/Path.java

@@ -72,14 +72,36 @@ public class Path {
      * 
      * @throws IllegalArgumentException If the list of nodes is not valid, i.e. two
      *         consecutive nodes in the list are not connected in the graph.
-     * 
-     * @deprecated Need to be implemented.
      */
     public static Path createShortestPathFromNodes(Graph graph, List<Node> nodes)
             throws IllegalArgumentException {
         List<Arc> arcs = new ArrayList<Arc>();
-        // TODO:
+
-        return new Path(graph, arcs);
+        if (nodes.size() == 0)
+            return new Path(graph);
+        else if (nodes.size() == 1)
+            return new Path(graph, nodes.get(0)); //test
+        else {
+            // skip the last node because it is the destination
+            for (int i = 0; i < nodes.size() - 1; i++) {
+                Node current = nodes.get(i);
+                Node next = nodes.get(i + 1);
+                Arc fastest = null;
+
+                for (Arc arc : current.getSuccessors()) {
+                    if (arc.getDestination() == next
+                            && (fastest == null
+                                || arc.getLength() < fastest.getLength()))
+                        fastest = arc;
+                }
+
+                if (fastest == null)
+                    throw new IllegalArgumentException("Requested nodes are not adjacent");
+                else
+                    arcs.add(fastest);
+            }
+            return new Path(graph, arcs);
+        }
     }
 
     /**