GitHub - beem812/Shortest-Path-Implementation: Implemented Djikstra's algorithm for finding the shortest path from one node to all others. A grey scale image is read in with one byte numbers representing "altitude" of that node in the graph and the difference in altitude between nodes representing the cost of moving between those nodes.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 13 Commits
ShortestPath		ShortestPath
.gitattributes		.gitattributes
.gitignore		.gitignore
ShortestPath.sln		ShortestPath.sln

About

Implemented Djikstra's algorithm for finding the shortest path from one node to all others. A grey scale image is read in with one byte numbers representing "altitude" of that node in the graph and the difference in altitude between nodes representing the cost of moving between those nodes.