This project is about implementing Dijsktra's shortest path search algorithm ([url removed, login to view]) in a special context of a pre-existing software package written in C/C++. The pre-existing software package defines a domain-specific language which
constructs a very large graph. This graph is searched using a fixed rule determining how to go from one node to the next, until it finds one of several possible solutions, as at each point in the graph, it can be tested whether a solution has been reached.
This strict rule shall be removed. Instead, there will be an edge length value for each connection in the graph and Dijkstra's algorithm shall be used to determine where to go next. If a solution is reached, the sum of the edge lengths is defined as the path length, which Dijkstra's algorithm minimizes.
To do this, I want you to add a new command/parameter to a function of the DSL and help me compile the software package.
You may use a pre-existing version of Dijkstra's algorithm in C/C++, as there are many available on the net already.