'''
sum of the edges when traversing a graph is as small as possible. If there are no weights,
select the path with the fewest edges.
dijkstra's algorithm:
1. create a distance weight for each possible path, with the
'''
