Project writtten for AISD course implements Dijkstra's pathfinding algorithm on a graph generated based of an ascii art map. After inputtiing, the map is analised and required data like city names, placement and roads is memorised. The focus of this project was time optimisation and proper data managment.
-
Notifications
You must be signed in to change notification settings - Fork 0
jigglestrudel/AISD2
About
Jak dojade? - A C project implementing Dijkstra algorithm and dynamically allocated data structures to find shortest routes between cities on an asciii art map
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published