title: Find the cost of all paths in a matrix using Dijkstra's Algorithm in Python
body: <p>I'm trying to create a program that from a starting coordinate finds the lowest cost path of traveling to all of the other coordinates in a matrix using Dijkstra's Algorithm. Any coordinate that has an infinite value is avoided when traversing.</p>