The goal of this implementation is first for me to have a hand on the swift language, but also I wanted to compare the perfomances with an Objective C implementation. It's the basic Dijkstra algorithm ...

* A directed, weighted adjacency-list graph shared by the shortest-path demos. * Each neighbour entry carries the edge weight, which the relaxation step uses. * Invariant: adj has one neighbour list ...