-
Notifications
You must be signed in to change notification settings - Fork 0
Home
Marco Carrozzo edited this page Dec 22, 2017
·
1 revision
Intermediate project for LASD course, written in C.
The program reads a maze from /maps folder and uses one of the algorithms for min-pathfind. map file can be both an implicit or explicit graph.
Implemented pathfinding algorithms are: BFS, Dykstra, A* Implemented data structures: Stack, Queues, Heaps, Graph (n x m VCOORD objects) The map files are read with a recursive BNF parser
Data structures and Algorithms are organized into pseudo objects, using callbacks.