epsilonesque

be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/DijkstraAlgorithm.java

@@ -3,18 +3,26 @@ package org.insa.graphs.algorithm.shortestpath;
 public class DijkstraAlgorithm extends ShortestPathAlgorithm {
 
     public DijkstraAlgorithm(ShortestPathData data) {
-        super(data);
+        super(data) ;
     }
 
     @Override
     protected ShortestPathSolution doRun() {
         // First step: get data from the input problem.
         // The getInputData method is inherited from parent class ShortestPathAlgorithm
-        final ShortestPathData data = getInputData();
+        final ShortestPathData data = getInputData() ;
         
         ShortestPathSolution solution = null;
+
+        //
         // TODO:
-        return solution;
+        //
+
+
+        
+
+        // When the algorithm terminates, return the solution that has been found.
+        return solution ;
     }
 
 }

be-graphes-algos/src/main/java/org/insa/graphs/algorithm/utils/BinaryHeap.java

@@ -136,7 +136,7 @@ public class BinaryHeap<E extends Comparable<E>> implements PriorityQueue<E> {
     }
 
     @Override
-    public void remove(E x) throws ElementNotFoundException {
+    public void remove(E x) throws ElementNotFoundException{
         // TODO:
     }