Running time of Dijkstra’s algorithm:
n insertions: O(n log n) time (actually O(n))
n deleteMins: O(n log n) time
e lookups: O(e log n) time (actually O(e))
e Dist value mods: O(e log n) time
Running time: O((n + e) log n))
Can also do O(n2). Better for dense graphs