Table of Contents
shortestPath ( G, A, s, t, )
Find a shortest path and return it as a set of edges. If no path exists, it returns None