From 86140f4d3af33a14361e4c3a1144f93baead4251 Mon Sep 17 00:00:00 2001 From: Matteo Date: Tue, 29 Apr 2025 17:32:36 +0200 Subject: [PATCH] =?UTF-8?q?d=C3=A9but=20pseudo=20code=20Dijkstra=20et=20m?= =?UTF-8?q?=C3=A0j=20BinaryHeap?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../algorithm/shortestpath/DijkstraAlgorithm.java | 13 +++++++++++++ .../org/insa/graphs/algorithm/utils/BinaryHeap.java | 2 +- 2 files changed, 14 insertions(+), 1 deletion(-) diff --git a/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/DijkstraAlgorithm.java b/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/DijkstraAlgorithm.java index 18a540f..eb9739f 100644 --- a/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/DijkstraAlgorithm.java +++ b/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/DijkstraAlgorithm.java @@ -1,5 +1,8 @@ package org.insa.graphs.algorithm.shortestpath; +import java.util.org.insa.graphs.algorithm.shortestpath.labels; + + public class DijkstraAlgorithm extends ShortestPathAlgorithm { public DijkstraAlgorithm(ShortestPathData data) { @@ -18,6 +21,16 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm { // TODO: implement the Dijkstra algorithm + /*pseudo code : + on a à une destination et une origine et un graph pour les appliquer (et arcinspector jsp à quoi sert encore) + + dans graphe y'a la liste de nodes + dans chaque node y'a la liste de succesor avec des arcs + dans les arcs on peut avoir la destination + + + */ + // when the algorithm terminates, return the solution that has been found return solution; } diff --git a/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/utils/BinaryHeap.java b/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/utils/BinaryHeap.java index df29f3a..cf6dbcc 100644 --- a/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/utils/BinaryHeap.java +++ b/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/utils/BinaryHeap.java @@ -142,7 +142,7 @@ public class BinaryHeap> implements PriorityQueue { } } - if (ind == -1) { + if (ind == -1) { throw new ElementNotFoundException(x); }