Here is a very simple little class for finding a shortest route on a network, following Dijkstra's Algorithm:
Code:
#!/usr/bin/env python
#This is meant to solve a maze with Dijkstra's algorithm
from numpy import inf
from copy import copy
class Graph(object):
"""A graph object that has a set of singly connected,weighted,
directed edges