a LinkedList of the active nodes during execution of Dijkstra's algorithm
This list will be initialized as a clone of nodes, and retired nodes
removed from it.
Assuming this OpenList is an association list (list of non-empty lists),
where the head elements are "key" values, search to find the head list
that equals a given key.