From eb0a2b280207e2a1e90b7ac7d5095e0e3c706f00 Mon Sep 17 00:00:00 2001
From: Anhgelus Morhtuuzh <william@herges.fr>
Date: Sat, 29 Nov 2025 14:14:45 +0100
Subject: Cours du 24 au 28 novembre

---
 .../tme/tme6-11/Reseau.c"                             | 19 +++++++++++++++++++
 1 file changed, 19 insertions(+)

(limited to 'semestre 3/structures des données/tme/tme6-11/Reseau.c')

diff --git "a/semestre 3/structures des donn\303\251es/tme/tme6-11/Reseau.c" "b/semestre 3/structures des donn\303\251es/tme/tme6-11/Reseau.c"
index cbdaa88..151bcfe 100644
--- "a/semestre 3/structures des donn\303\251es/tme/tme6-11/Reseau.c"	
+++ "b/semestre 3/structures des donn\303\251es/tme/tme6-11/Reseau.c"	
@@ -27,8 +27,11 @@ Reseau* reconstitueReseauListe(Chaines *C){
         CellPoint* points = chain->points;
         CellNoeud* before;
         CellNoeud* beforeTwice;
+        CellCommodite* com = malloc(sizeof(CellCommodite));
+        com->extrA = NULL;
         while (points){
             Noeud* node = rechercheCreeNoeudListe(R, points->x, points->y);
+            if (!com->extrA) com->extrA = node;
             // represents voisins of node
             CellNoeud* cellNode = (CellNoeud*) malloc(sizeof(CellNoeud));
             cellNode->nd = node;
@@ -42,12 +45,28 @@ Reseau* reconstitueReseauListe(Chaines *C){
             }
             beforeTwice = before;
             before = cellNode;
+            if (!points->suiv) com->extrB = node;
             points = points->suiv;
         }
         if (beforeTwice && before){
             before->nd->voisins = beforeTwice; // set before voisins
         }
+        com->suiv = R->commodites;
+        R->commodites = com;
         chain = chain->suiv;
     }
     return R;
 }
+
+int nbLiaisons(Reseau *R){
+    return 0;
+}
+
+int nbCommodites(Reseau *R){
+    int i;
+    CellCommodite* com = R->commodites;
+    for (i = 0; com; i++) com = com->suiv;
+    return i;
+}
+
+void afficheReseauSVG(Reseau *R, char* nomInstance);
-- 
cgit v1.2.3