There are no reviews yet. Be the first to send feedback to the community and the maintainers!
Repository Details
This program was implemented as part of the Dynamic Programming undergraduate course at the Technical University of Crete. By using the method of Dynamic Programming, the program finds the shortest path in a weighted graph based on a multi-level decision problem. The program can find the shortest path in any kind of acyclic weighted graph, including the one required by the exercise's rules.
