added new features

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

         // We stop the algorithm when the cost of last marked point is equal to the shortest found path
         // or if we searched all the graph
         while(lastMarkedNodeCost < shortestCostToDestination && !minHeap.isEmpty()) {
+   
         	
         	//We get the shortest not marked label
         	Label minLabel = minHeap.deleteMin();

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

 		return totalTime;
 	}
 
+	/**
+	 * Compares the path with other path object
+	 * @param other
+	 * @return
+	 */
+	public boolean isSamePath(Path other) {
+		for(int i = 0 ; i < arcs.size() ; i++) {
+			if(this.arcs.get(i).getOrigin().getId() != other.arcs.get(i).getOrigin().getId()) {
+				return false;
+			}
+			if(this.arcs.get(i).getDestination().getId() != other.arcs.get(i).getDestination().getId()) {
+				return false;
+			}
+		}
+		return true;
+	}
 }