# lem-in (Ants)
Your ant colony must move from on point to another. How do you do it in the shortest time possible? This project will get you acquainted with graph traversal algorithms: your program will have to intelligently select paths and precise movements used by the ants
Parcours de graphe Algorithmes en profondeur
Imperative programming Rigor Algorithms & AI
- Graph Theory.
- BFS/DFS "Graph Traversal".
- Max Flow algorithms.
- Hash-tables.
- Dynamic Arrays.