Comparable is a Swift standard-library protocol for values that can be ordered relative to one another. A generic Node adopts it so search algorithms can rank nodes. section 2.2
Ordering search nodes
Node<T> conforms to Comparable and implements < by comparing cost + heuristic. A node with the lower combined value sorts before the other node. The same type also conforms to Hashable, while == compares node identity.
This ordering prepares Node for reuse in A*, where a priority queue can select the most promising node according to its cost and heuristic. section 2.2


