Python, Graph, Algorithms.
dijkstra that takes a graph and a start node as input and returns the shortest distances from the start node to all other nodes. The graph is represented as a dictionary of dictionaries, where the keys of the outer dictionary are the nodes and the values are dictionaries that represent the edges