Use sort.Slice in TestHeapOrdering function in routing/heap_test.go, as part of the move to use new language features.
This commit introduces a new heap struct that will be used to keep track of the next closest node to the source during path finding within our modified Dijkstra's algorithm.