diff --git a/antes_colony/Makefile b/Makefile
similarity index 100%
rename from antes_colony/Makefile
rename to Makefile
diff --git a/README.md b/README.md
deleted file mode 100644
index 77ffc9d06a89c97599a6bb5f9d362c7bd21e5392..0000000000000000000000000000000000000000
--- a/README.md
+++ /dev/null
@@ -1,92 +0,0 @@
-# Ants_colony_algorithm
-
-
-
-## Getting started
-
-To make it easy for you to get started with GitLab, here's a list of recommended next steps.
-
-Already a pro? Just edit this README.md and make it your own. Want to make it easy? [Use the template at the bottom](#editing-this-readme)!
-
-## Add your files
-
-- [ ] [Create](https://docs.gitlab.com/ee/user/project/repository/web_editor.html#create-a-file) or [upload](https://docs.gitlab.com/ee/user/project/repository/web_editor.html#upload-a-file) files
-- [ ] [Add files using the command line](https://docs.gitlab.com/ee/gitlab-basics/add-file.html#add-a-file-using-the-command-line) or push an existing Git repository with the following command:
-
-```
-cd existing_repo
-git remote add origin https://gitedu.hesge.ch/agnon.kurteshi/ants_colony_algorithm.git
-git branch -M main
-git push -uf origin main
-```
-
-## Integrate with your tools
-
-- [ ] [Set up project integrations](https://gitedu.hesge.ch/agnon.kurteshi/ants_colony_algorithm/-/settings/integrations)
-
-## Collaborate with your team
-
-- [ ] [Invite team members and collaborators](https://docs.gitlab.com/ee/user/project/members/)
-- [ ] [Create a new merge request](https://docs.gitlab.com/ee/user/project/merge_requests/creating_merge_requests.html)
-- [ ] [Automatically close issues from merge requests](https://docs.gitlab.com/ee/user/project/issues/managing_issues.html#closing-issues-automatically)
-- [ ] [Enable merge request approvals](https://docs.gitlab.com/ee/user/project/merge_requests/approvals/)
-- [ ] [Automatically merge when pipeline succeeds](https://docs.gitlab.com/ee/user/project/merge_requests/merge_when_pipeline_succeeds.html)
-
-## Test and Deploy
-
-Use the built-in continuous integration in GitLab.
-
-- [ ] [Get started with GitLab CI/CD](https://docs.gitlab.com/ee/ci/quick_start/index.html)
-- [ ] [Analyze your code for known vulnerabilities with Static Application Security Testing(SAST)](https://docs.gitlab.com/ee/user/application_security/sast/)
-- [ ] [Deploy to Kubernetes, Amazon EC2, or Amazon ECS using Auto Deploy](https://docs.gitlab.com/ee/topics/autodevops/requirements.html)
-- [ ] [Use pull-based deployments for improved Kubernetes management](https://docs.gitlab.com/ee/user/clusters/agent/)
-- [ ] [Set up protected environments](https://docs.gitlab.com/ee/ci/environments/protected_environments.html)
-
-***
-
-# Editing this README
-
-When you're ready to make this README your own, just edit this file and use the handy template below (or feel free to structure it however you want - this is just a starting point!).  Thank you to [makeareadme.com](https://www.makeareadme.com/) for this template.
-
-## Suggestions for a good README
-Every project is different, so consider which of these sections apply to yours. The sections used in the template are suggestions for most open source projects. Also keep in mind that while a README can be too long and detailed, too long is better than too short. If you think your README is too long, consider utilizing another form of documentation rather than cutting out information.
-
-## Name
-Choose a self-explaining name for your project.
-
-## Description
-Let people know what your project can do specifically. Provide context and add a link to any reference visitors might be unfamiliar with. A list of Features or a Background subsection can also be added here. If there are alternatives to your project, this is a good place to list differentiating factors.
-
-## Badges
-On some READMEs, you may see small images that convey metadata, such as whether or not all the tests are passing for the project. You can use Shields to add some to your README. Many services also have instructions for adding a badge.
-
-## Visuals
-Depending on what you are making, it can be a good idea to include screenshots or even a video (you'll frequently see GIFs rather than actual videos). Tools like ttygif can help, but check out Asciinema for a more sophisticated method.
-
-## Installation
-Within a particular ecosystem, there may be a common way of installing things, such as using Yarn, NuGet, or Homebrew. However, consider the possibility that whoever is reading your README is a novice and would like more guidance. Listing specific steps helps remove ambiguity and gets people to using your project as quickly as possible. If it only runs in a specific context like a particular programming language version or operating system or has dependencies that have to be installed manually, also add a Requirements subsection.
-
-## Usage
-Use examples liberally, and show the expected output if you can. It's helpful to have inline the smallest example of usage that you can demonstrate, while providing links to more sophisticated examples if they are too long to reasonably include in the README.
-
-## Support
-Tell people where they can go to for help. It can be any combination of an issue tracker, a chat room, an email address, etc.
-
-## Roadmap
-If you have ideas for releases in the future, it is a good idea to list them in the README.
-
-## Contributing
-State if you are open to contributions and what your requirements are for accepting them.
-
-For people who want to make changes to your project, it's helpful to have some documentation on how to get started. Perhaps there is a script that they should run or some environment variables that they need to set. Make these steps explicit. These instructions could also be useful to your future self.
-
-You can also document commands to lint the code or run tests. These steps help to ensure high code quality and reduce the likelihood that the changes inadvertently break something. Having instructions for running tests is especially helpful if it requires external setup, such as starting a Selenium server for testing in a browser.
-
-## Authors and acknowledgment
-Show your appreciation to those who have contributed to the project.
-
-## License
-For open source projects, say how it is licensed.
-
-## Project status
-If you have run out of energy or time for your project, put a note at the top of the README saying that development has slowed down or stopped completely. Someone may choose to fork your project or volunteer to step in as a maintainer or owner, allowing your project to keep going. You can also make an explicit request for maintainers.
diff --git a/antes_colony/fourmi.o b/antes_colony/fourmi.o
deleted file mode 100644
index 3fd1b78186ea6b3e8c0614be7162b1ffd9db06f0..0000000000000000000000000000000000000000
Binary files a/antes_colony/fourmi.o and /dev/null differ
diff --git a/antes_colony/graphe.o b/antes_colony/graphe.o
deleted file mode 100644
index 509ee7aa530f3df2435dac25674d2834fd532455..0000000000000000000000000000000000000000
Binary files a/antes_colony/graphe.o and /dev/null differ
diff --git a/antes_colony/main.c b/antes_colony/main.c
deleted file mode 100644
index 30b8c673750d2f3bf8451aec264d64c730b10ca3..0000000000000000000000000000000000000000
--- a/antes_colony/main.c
+++ /dev/null
@@ -1,66 +0,0 @@
-#include "graphe/graphe.h"
-// #include "stack/stack.h"
-
-int main()
-{
-    double testestset = 0;
-    testestset = ((0.5)*1.0)+(45.0/434.0);
-    printf("test calcul %f\n",testestset);
-    srand(time(NULL));
-    graph g1 = create_graph(7);
-    stack stack;
-    stack_init(&stack, 50);
-
-    // printf("\n");
-    // matrix_print(*g1->pheromone);
-    // printf("\nadded edge\n\n");
-    add_edge(g1, 4, 3, 1.0);
-    add_edge(g1, 1, 3, 2.0);
-    add_edge(g1, 2, 3, 2.0);
-    add_edge(g1, 4, 1, 3.0);
-    add_edge(g1, 0, 1, 5.0);
-    add_edge(g1, 0, 4, 1.0);
-    add_edge(g1, 0, 2, 1.0);
-    add_edge(g1, 0, 3, 8.0);
-    add_edge(g1, 3, 5, 1.0);
-    add_edge(g1, 5, 6, 1.0);
-    add_edge(g1, 2, 5, 2.0);
-    add_edge(g1, 1, 6, 4.0);
-    add_edge(g1, 0, 5, 5.0);
-    matrix_print(*g1->pheromone);
-    for (int i = 0; i < 10000; i++)
-    {
-        frmi f = create_fourmi();
-        random_path(g1, 0, f);
-        destroy_fourmi(f);
-    }
-    
-    printf("\n length path matrix \n");
-    matrix_print(*g1->edges);
-    printf("\npheromone matrix \n");
-    matrix_print(*g1->pheromone);
-    // printf("\npheromone changed\n\n");
-    // pheromone_dissipation(g1);
-    // matrix_print(*g1->pheromone);
-    // algorithme_des_fourmils(1, 3, g1);
-
-    printf("====================================================");
-    // first_walk(g1, 0, &stack);
-    printf("\n%d a %d voisins \n", 0, nb_voisin(g1, 0));
-
-    printf("====================================================");
-
-    create_graph_vis(g1);
-    display_graph_vis();
-    frmi eclaireuse = create_fourmi();
-    // shortest_path(g1, eclaireuse, 0);
-    // printf("shortest path is : ");
-    // print_stack(*eclaireuse->path);
-    // printf("\n");
-    // destroy_fourmi(eclaireuse);
-    
-    destroy_graph(g1);
-    stack_destroy(&stack);
-
-    return 0;
-}
\ No newline at end of file
diff --git a/antes_colony/main.o b/antes_colony/main.o
deleted file mode 100644
index de911c75734588e69513b3659949212736815200..0000000000000000000000000000000000000000
Binary files a/antes_colony/main.o and /dev/null differ
diff --git a/antes_colony/matrix.o b/antes_colony/matrix.o
deleted file mode 100644
index 7a3327178aab672328497ed3064c12f0d0d84257..0000000000000000000000000000000000000000
Binary files a/antes_colony/matrix.o and /dev/null differ
diff --git a/antes_colony/stack.o b/antes_colony/stack.o
deleted file mode 100644
index 242931fa3944b295d33589a679d003ad1de2adf3..0000000000000000000000000000000000000000
Binary files a/antes_colony/stack.o and /dev/null differ
diff --git a/antes_colony/test2.dot b/antes_colony/test2.dot
deleted file mode 100644
index c1f6d86103eda9cb47dc6d36637534670f351fbd..0000000000000000000000000000000000000000
--- a/antes_colony/test2.dot
+++ /dev/null
@@ -1,15 +0,0 @@
-digraph Test {
-0->1[penwidth=2, label= 5.000000]
-0->2[penwidth=2, label= 1.000000]
-0->3[penwidth=2, label= 8.000000]
-0->4[penwidth=2, label= 1.000000]
-0->5[penwidth=2, label= 5.000000]
-1->3[penwidth=2, label= 2.000000]
-1->6[penwidth=2, label= 4.000000]
-2->3[penwidth=2, label= 2.000000]
-2->5[penwidth=2, label= 2.000000]
-3->5[penwidth=2, label= 1.000000]
-4->1[penwidth=2, label= 3.000000]
-4->3[penwidth=2, label= 1.000000]
-5->6[penwidth=2, label= 1.000000]
-}
\ No newline at end of file
diff --git a/antes_colony/test2.dot.png b/antes_colony/test2.dot.png
deleted file mode 100644
index 7d7a38cb9bb7b96a1d33a999ce120720ba19b9d8..0000000000000000000000000000000000000000
Binary files a/antes_colony/test2.dot.png and /dev/null differ
diff --git a/antes_colony/tp_fourmi b/antes_colony/tp_fourmi
deleted file mode 100755
index 34468f5c7974b76da0dcd664823c59434f4e9227..0000000000000000000000000000000000000000
Binary files a/antes_colony/tp_fourmi and /dev/null differ
diff --git a/antes_colony/fourmi/fourmi.c b/fourmi/fourmi.c
similarity index 100%
rename from antes_colony/fourmi/fourmi.c
rename to fourmi/fourmi.c
diff --git a/antes_colony/fourmi/fourmi.h b/fourmi/fourmi.h
similarity index 100%
rename from antes_colony/fourmi/fourmi.h
rename to fourmi/fourmi.h
diff --git a/antes_colony/graphe/graphe.c b/graphe/graphe.c
similarity index 70%
rename from antes_colony/graphe/graphe.c
rename to graphe/graphe.c
index 6e23c042bcf97eebfcd6f578ad90af13c593cbfb..24e85e1e7de27a2e3f9e4bb9b0df35bb70ab0074 100644
--- a/antes_colony/graphe/graphe.c
+++ b/graphe/graphe.c
@@ -1,6 +1,6 @@
 #include "graphe.h"
-#define RHO 0.5
-graph create_graph(int num)
+#define RHO 0.01
+graph create_graph(int num, int fourmiliere, int nourriture)
 {
     graph gr = malloc(sizeof(g));
     if (gr == NULL)
@@ -17,7 +17,8 @@ graph create_graph(int num)
     matrix *mat2 = malloc(sizeof(matrix));
     matrix_init(mat2, num, num, 1);
     gr->pheromone = mat2;
-    printf("rand %d, \n", rand());
+    gr->foumiliere = fourmiliere;
+    gr->nourriture = nourriture;
     return gr;
 }
 
@@ -57,10 +58,7 @@ int nb_voisin(graph g, int noeud)
 
 double ph_x_dist(graph g, int from, int to)
 {
-
     double ph_x_dst = g->pheromone->data[from][to] * (1 / g->edges->data[from][to]);
-    // printf("phx : %f", g->pheromone->data[1][0]);
-
     return ph_x_dst;
 }
 
@@ -70,22 +68,20 @@ stack ants_path(stack frmi, int path)
     return frmi;
 }
 
-void pheromone_dissipation(graph g)
+void pheromone_dissipation(graph g, int rho)
 {
     for (int from = 0; from < g->num; from++)
     {
         for (int to = 0; to < g->num; to++)
         {
-    
-                g->pheromone->data[from][to] = (1-RHO)*g->pheromone->data[from][to];
-            
+
+            g->pheromone->data[from][to] = (1 - rho) * g->pheromone->data[from][to];
         }
     }
 }
 
 int path_probability_taken(graph g, int noeud)
 {
-    printf("rentré par : %d\n", noeud);
     double tab[g->num];
     double tab_cumul[g->num];
     // initialisation des tableaux à 0
@@ -103,14 +99,15 @@ int path_probability_taken(graph g, int noeud)
             somme_pour_proba += ph_x_dist(g, noeud, r);
         }
     }
-    printf("dénominateur : %f \n", somme_pour_proba);
-    // printf("%d somme proab\n", (int)somme_pour_proba);
+    if (somme_pour_proba == 0)
+    {
+        return noeud;
+    }
     for (int i = 0; i < g->num; i++)
     {
         if (has_edge(g, noeud, i))
         {
             tab[i] = (g->pheromone->data[noeud][i] * (1.0 / g->edges->data[noeud][i])) / somme_pour_proba;
-            printf("valeur dans tab[%d]: %f\n", i, tab[i]);
         }
     }
     // Calcul nombre total de phéromone
@@ -119,8 +116,6 @@ int path_probability_taken(graph g, int noeud)
     {
         sum_phero += tab[j];
     }
-    printf("somme total phéromone : %f\n", sum_phero);
-
     // somme cumulative du tableau
     for (int x = g->num - 1; x >= 0; x--)
     {
@@ -128,43 +123,17 @@ int path_probability_taken(graph g, int noeud)
         {
             tab_cumul[x] += tab[y];
         }
-        printf("valeur dans tabcumul[%d]: %f\n", x, tab[x]);
     }
-
-    // print tableau
-    // for (int a = 0; a < g->num; a++)
-    // {
-    //     printf("[%f]", tab[a]);
-    // }
-    printf("cumul : ");
-    for (int b = 0; b < g->num; b++)
-    {
-        printf("[%f]", tab_cumul[b]);
-    }
-    printf("\n");
-    // printf("\n");
-
     // calcul de la probabilité
 
     double chemin_probabiliste = (double)rand() / (double)RAND_MAX; // nb entre 0 et 1
-    printf("%f, \n", chemin_probabiliste);
-    printf("nombre aléatoire tiré : %f\n", chemin_probabiliste);
-    // if(chemin_probabiliste == 0)
-    // {
-    //     chemin_probabiliste = 1;
-    // }
     for (int z = 0; z < g->num; z++)
     {
         if (chemin_probabiliste <= tab_cumul[z])
         {
-            printf("passe par %d -> %d\n", noeud, z);
-            // printf("le nombre de phéromone %d et la probabilité est %d et z est %d et tab_cumul est %d\n", sum_phero, chemin_probabiliste, z, tab_cumul[z]);
             return z;
         }
     }
-    // chemin_probabiliste = chemin_probabiliste % (sum_phero +1);
-    printf("\n");
-    // printf("le nombre de phéromone %d et la probabilité est %d\n", sum_phero, chemin_probabiliste);
     return 0;
 }
 
@@ -173,13 +142,26 @@ double pheromone_depose(double distance)
     return 1.0000 / distance;
 }
 
-void random_path(graph g, int noeud, frmi f)
+int launch_colonization(graph g, int nb_fourmi, double rho)
+{
+    int nb_fourmi_perdue = 0;
+    for (int i = 0; i < nb_fourmi; i++)
+    {
+        frmi f = create_fourmi();
+        nb_fourmi_perdue += random_path(g, 0, rho, f);
+        destroy_fourmi(f);
+    }
+    return nb_fourmi_perdue;
+}
+
+int random_path(graph g, int noeud, double rho, frmi f)
 {
     // f->ttl--;
     // condition d'arret si on arrive au noeud final ou si le ttl est à 0
-    if (noeud == 6 || f->ttl <= 0)
+    if (noeud == g->nourriture)
     {
-        return;
+        f->depose_pheromone = 1;
+        return 0;
     }
     ////////////////////////////////////////////////////////////////////////
     // calcul chemin aléatoire et renvoi l'indice du chemin à prendre
@@ -187,6 +169,11 @@ void random_path(graph g, int noeud, frmi f)
     // do
     // {
     chemin_aleatoire = path_probability_taken(g, noeud);
+    if (chemin_aleatoire == noeud)
+    {
+        f->depose_pheromone = 0;
+        return 1;
+    }
     // } while (!has_edge(g, noeud, chemin_aleatoire));
     //-----------------------------------------------------------------
 
@@ -196,20 +183,26 @@ void random_path(graph g, int noeud, frmi f)
     stack_push(f->path, noeud);
     stack_push(f->path, chemin_aleatoire);
     // la récursivité de l'algorithme (parcours graphe en profondeur)
-    random_path(g, chemin_aleatoire, f);
-    printf("phero depose %f\n", pheromone_depose(f->distance));
+    int fourmi_perdu;
+    fourmi_perdu = random_path(g, chemin_aleatoire, rho, f);
     // if(f->ttl == 0)
     // {
     //     return;
     // }
-    g->pheromone->data[noeud][chemin_aleatoire] = ((1-RHO)*g->pheromone->data[noeud][chemin_aleatoire])+ pheromone_depose(f->distance);
-    printf("déposé comme phéromone : %f\n", g->pheromone->data[noeud][chemin_aleatoire]);
-    printf("f->distance = %d\n", f->distance);
+    if (f->depose_pheromone)
+    {
+        g->pheromone->data[noeud][chemin_aleatoire] = ((1 - rho) * g->pheromone->data[noeud][chemin_aleatoire]) + pheromone_depose(f->distance);
+    }
     // print_stack(*f->path);
     // if(noeud == 0)
     // {
     //     pheromone_dissipation(g);
     // }
+    if (fourmi_perdu)
+    {
+        return 1;
+    }
+    return 0;
 }
 
 void create_graph_vis(graph g)
@@ -236,9 +229,9 @@ void create_graph_vis(graph g)
 
 void shortest_path(graph g, frmi f, int noeud)
 {
-    printf("%d noeud", noeud);
-    if (noeud == 6)
+    if (noeud == g->nourriture)
     {
+        stack_push(f->path, noeud);
         return;
     }
     double bigger = 0;
@@ -253,11 +246,8 @@ void shortest_path(graph g, frmi f, int noeud)
         }
         if (i == g->num - 1)
         {
-            printf("s\n\n");
-
-            shortest_path(g, f, index);
             stack_push(f->path, noeud);
-            stack_push(f->path, index);
+            shortest_path(g, f, index);
         }
     }
 }
@@ -271,8 +261,6 @@ void display_graph_vis()
 
 void destroy_graph(graph g)
 {
-    printf("distance_pheromone : %.0f\n", ph_x_dist(g, 0, 1));
-    printf("phero : %f\n", g->pheromone->data[0][1]);
     if (g->edges->data == NULL)
     {
         return;
diff --git a/antes_colony/graphe/graphe.h b/graphe/graphe.h
similarity index 75%
rename from antes_colony/graphe/graphe.h
rename to graphe/graphe.h
index e0d3b1c2d70956b531f44751a2f0b31f6581accb..5cd23bb592beefd18c2453075d356d5e069bf87d 100644
--- a/antes_colony/graphe/graphe.h
+++ b/graphe/graphe.h
@@ -12,11 +12,13 @@ typedef struct _graph
     int num;
     matrix *edges;
     matrix *pheromone;
+    int foumiliere;
+    int nourriture;
 } g;
 
 typedef g *graph;
 
-graph create_graph(int num);
+graph create_graph(int num, int fourmiliere, int nourriture);
 
 int has_edge(graph g, int from_node, int to_node);
 
@@ -24,7 +26,9 @@ void add_edge(graph g, int from_node, int to_node, double distance);
 
 int nb_voisin(graph g, int noeud);
 
-void random_path(graph g, int noeud, frmi f);
+int random_path(graph g, int noeud, double rho, frmi f);
+
+int launch_colonization(graph g, int nb_fourmi, double rho);
 
 void shortest_path(graph g, frmi f, int noeud);
 
diff --git a/main.c b/main.c
new file mode 100644
index 0000000000000000000000000000000000000000..3a8e6ae1c03750ee023a649c7a35dc4f6a0c67a8
--- /dev/null
+++ b/main.c
@@ -0,0 +1,53 @@
+#include "graphe/graphe.h"
+// #include "stack/stack.h"
+
+int main()
+{
+    srand(time(NULL));
+    graph g1 = create_graph(8, 0, 7);
+    stack stack;
+    stack_init(&stack, 50);
+
+    // printf("\n");
+    // matrix_print(*g1->pheromone);
+    // printf("\nadded edge\n\n");
+    add_edge(g1, 0, 1, 2.0);
+    add_edge(g1, 1, 2, 5.0);
+    add_edge(g1, 1, 3, 2.0);
+    add_edge(g1, 1, 5, 2.0);
+    add_edge(g1, 2, 3, 1.0);
+    add_edge(g1, 3, 1, 1.0);
+    add_edge(g1, 2, 6, 4.0);
+    add_edge(g1, 3, 4, 4.0);
+    add_edge(g1, 3, 5, 2.0);
+    add_edge(g1, 3, 6, 3.0);
+    add_edge(g1, 3, 7, 4.0);
+    add_edge(g1, 4, 7, 2.0);
+    add_edge(g1, 6, 7, 2.0);
+    int nb_fourmi_perdu = 0;
+    nb_fourmi_perdu = launch_colonization(g1, 1000000, 0.05);
+    
+    printf("\n length path matrix \n");
+    matrix_print(*g1->edges);
+    printf("\npheromone matrix \n");
+    matrix_print(*g1->pheromone);
+    printf("number of ants lost : %d\n", nb_fourmi_perdu);
+    // printf("\npheromone changed\n\n");
+    // pheromone_dissipation(g1);
+    // matrix_print(*g1->pheromone);
+    // algorithme_des_fourmils(1, 3, g1);
+
+    create_graph_vis(g1);
+    display_graph_vis();
+    frmi eclaireuse = create_fourmi();
+    shortest_path(g1, eclaireuse, 0);
+    printf("shortest path is : ");
+    print_stack(*eclaireuse->path);
+    printf("\n");
+    destroy_fourmi(eclaireuse);
+    
+    destroy_graph(g1);
+    stack_destroy(&stack);
+
+    return 0;
+}
\ No newline at end of file
diff --git a/antes_colony/matrix/matrix.c b/matrix/matrix.c
similarity index 100%
rename from antes_colony/matrix/matrix.c
rename to matrix/matrix.c
diff --git a/antes_colony/matrix/matrix.h b/matrix/matrix.h
similarity index 100%
rename from antes_colony/matrix/matrix.h
rename to matrix/matrix.h
diff --git a/antes_colony/stack/stack.c b/stack/stack.c
similarity index 100%
rename from antes_colony/stack/stack.c
rename to stack/stack.c
diff --git a/antes_colony/stack/stack.h b/stack/stack.h
similarity index 100%
rename from antes_colony/stack/stack.h
rename to stack/stack.h
diff --git a/antes_colony/stack_stack/stack_stack.c b/stack_stack/stack_stack.c
similarity index 100%
rename from antes_colony/stack_stack/stack_stack.c
rename to stack_stack/stack_stack.c
diff --git a/antes_colony/stack_stack/stack_stack.h b/stack_stack/stack_stack.h
similarity index 100%
rename from antes_colony/stack_stack/stack_stack.h
rename to stack_stack/stack_stack.h
diff --git a/antes_colony/test.dot b/test.dot
similarity index 100%
rename from antes_colony/test.dot
rename to test.dot
diff --git a/test2.dot b/test2.dot
new file mode 100644
index 0000000000000000000000000000000000000000..5e595614f29c606b37e86abcd568338d1b0e7d00
--- /dev/null
+++ b/test2.dot
@@ -0,0 +1,15 @@
+digraph Test {
+0->1[penwidth=2, label= 2.000000]
+1->2[penwidth=2, label= 5.000000]
+1->3[penwidth=2, label= 2.000000]
+1->5[penwidth=2, label= 2.000000]
+2->3[penwidth=2, label= 1.000000]
+2->6[penwidth=2, label= 4.000000]
+3->1[penwidth=2, label= 1.000000]
+3->4[penwidth=2, label= 4.000000]
+3->5[penwidth=2, label= 2.000000]
+3->6[penwidth=2, label= 3.000000]
+3->7[penwidth=2, label= 4.000000]
+4->7[penwidth=2, label= 2.000000]
+6->7[penwidth=2, label= 2.000000]
+}
\ No newline at end of file
diff --git a/test2.dot.png b/test2.dot.png
new file mode 100644
index 0000000000000000000000000000000000000000..143ccff5fb274412510b4da8593c812dea32a8e7
Binary files /dev/null and b/test2.dot.png differ
diff --git a/tp_fourmi b/tp_fourmi
new file mode 100755
index 0000000000000000000000000000000000000000..b8826e097769e2e968894456f51705e47cb2aaa7
Binary files /dev/null and b/tp_fourmi differ