From fc6268576e59a2c96c0090171b30edf6f9b3552e Mon Sep 17 00:00:00 2001
From: Tiphaine Pellerin <tpellerin@insa-toulouse.fr>
Date: Mon, 1 Jun 2026 21:36:59 +0200
Subject: [PATCH] ajout de commentaires

---
 .../shortestpath/AStarAlgorithm.java          |   2 +-
 .../shortestpath/DijkstraAlgorithm.java       |   2 +-
 .../graphs/algorithm/shortestpath/Label.java  |   2 ++
 .../shortestpath/DijkstraAlgorithm.class      | Bin 5283 -> 5283 bytes
 .../graphs/algorithm/shortestpath/Label.class | Bin 1742 -> 1742 bytes
 5 files changed, 4 insertions(+), 2 deletions(-)

diff --git a/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/AStarAlgorithm.java b/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/AStarAlgorithm.java
index b1f515a..050c21f 100644
--- a/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/AStarAlgorithm.java
+++ b/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/AStarAlgorithm.java
@@ -8,7 +8,7 @@ public class AStarAlgorithm extends DijkstraAlgorithm {
         super(data);
     }
 
-        //@Override
+    // creates an 'empty' labelstar for the node given in argument
     public LabelStar newLabel(Node s, ShortestPathData dataPath) {
         return new LabelStar(s, false, Integer.MAX_VALUE, null,
                 s.getPoint().distanceTo(dataPath.getDestination().getPoint()));
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 1922d9e..8da7c4a 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
@@ -16,6 +16,7 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {
         super(data);
     }
 
+    // creates an 'empty' label for the node given in argument
     public Label newLabel(Node s) {
         return new Label(s, false, Double.MAX_VALUE, null);
     }
@@ -43,7 +44,6 @@ public class DijkstraAlgorithm extends ShortestPathAlgorithm {
                 notifyOriginProcessed(nod);
             }
         }
-
         Label xl = tas.findMin();
 
         // iterations
diff --git a/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/Label.java b/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/Label.java
index 88c00b4..c5c1e9d 100644
--- a/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/Label.java
+++ b/be-graphes-algos/src/main/java/org/insa/graphs/algorithm/shortestpath/Label.java
@@ -37,11 +37,13 @@ public class Label implements Comparable<Label> {
         return this.cout;
     }
 
+    // updates the label with the given arc and cost
     public void update(Arc p, double c){
         this.pere = p;
         this.cout = c;
     }
 
+    // compares the labels in term of cost
     @Override
     public int compareTo(Label l) {
         if (this.getCost() < l.getCost()) {
diff --git a/be-graphes-algos/target/classes/org/insa/graphs/algorithm/shortestpath/DijkstraAlgorithm.class b/be-graphes-algos/target/classes/org/insa/graphs/algorithm/shortestpath/DijkstraAlgorithm.class
index 7379db3a78d59f558b3e0cf9f3e9158a034ae044..6ebceee7d0c36d034a5c00b7ffc62e65ce365dbb 100644
GIT binary patch
delta 65
zcmZ3ixma^UHb0~2<{bVQCS6$uRt7l+E(Uo9eg*{wQ3gdIPo2SnL4(1OL6gCkL5m@U
TL7SnFL5HE7L4EUA!F5aka>WZ7

delta 65
zcmZ3ixma^UHb0}t<{bVQCS4f@Rt8xHE(SRUeg=64Q3eGdOO3&TL7l;oL4(1UL6aec
TL5rb~L7SnRL2dI_!F5akaXbqQ

diff --git a/be-graphes-algos/target/classes/org/insa/graphs/algorithm/shortestpath/Label.class b/be-graphes-algos/target/classes/org/insa/graphs/algorithm/shortestpath/Label.class
index 28229599e10afba31a3add9ec3efb6d10f450598..e85e1380b4a7ab044d2d648d25a6df19b16833c8 100644
GIT binary patch
delta 43
zcmX@ddyaR*9ac^)237`b1}+Aj$xm4`1q~T^7>pSB7)%(X7)%*t7%V2ov*iN-+tdh?

delta 43
zcmX@ddyaR*9ac_F237_w1}+Be$xm4`1@#$t7z`Nr7>pRC7>pTY7|bTev*iN-+Vu#A