GitHub - ajv012/DynamicProgramming: In this repo I show how I created a bellman optimality algorithm (aka dynamic programming) to find the best path between two American cities

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
NewOrleansToBuffalo.png		NewOrleansToBuffalo.png
OmahaToBrunswick.png		OmahaToBrunswick.png
README.txt		README.txt
SeattleToMiami.png		SeattleToMiami.png
city_data.csv		city_data.csv
city_data.py		city_data.py
city_data_small.csv		city_data_small.csv
city_data_user_guide.py		city_data_user_guide.py
find_path.py		find_path.py

Repository files navigation

In this repo, I share my implementation of Bellman's optimality principle/ dynammic programming. I use it to find the best path between two given American cities. Example outputs are shown in the .PNG files.