Shortest Path?

We've briefly touched on Dijkstra's Algorithm (Pronounced as Daik-stra), which is all about the shortest path. It makes me wonder though - everyday I walk about 15mins from the MRT to class, can I represent the paths available as a graph, and the walking distance as the weights of the edges?

This is what we know