Scala code for Dijkstra & Warshall algorithms. Tests provided in "src/tests".
I am a student in an French engineering school and I am learning Scala. I am a begginer: yes, this code is not perfect but eh, it works anyway. Moreover, this is a school project.
Please note that it is not coded in a pure functional way; use of Mutable Maps and imperative programming.
- Code in a pure functional way
- Code quality ?