Dijkstra's algorithm to find the shortest path A clojure implementation of Dijkstra's algorithm to find the shortest path in weighted and non-weighted graphs