We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent c1b0acf commit 8fa9e8fCopy full SHA for 8fa9e8f
README.md
@@ -0,0 +1,11 @@
1
+ ██╗ ███████╗███╗ ███╗ ██╗███╗ ██╗
2
+ ██║ ██╔════╝████╗ ████║ ██║████╗ ██║
3
+ ██║ █████╗ ██╔████╔██║█████╗██║██╔██╗ ██║
4
+ ██║ ██╔══╝ ██║╚██╔╝██║╚════╝██║██║╚██╗██║
5
+ ███████╗███████╗██║ ╚═╝ ██║ ██║██║ ╚████║
6
+ ╚══════╝╚══════╝╚═╝ ╚═╝ ╚═╝╚═╝ ╚═══╝
7
+
8
+You must move your ant colony from one point to another in the least amount of time.
9
+Through this project, you will explore graph traversal algorithms:
10
+your program will have to choose the paths and moves to be taken by the ants.
11
+Final grade = 125/100
0 commit comments