protected boolean addOrUpdate(V dest, double newDist) {
			// Is it already visited?
			Double curDist = visitedDistance.get(dest);
			if (curDist != null) {
				return false;
			}
			// Nope? Well let's update the records.
			curDist = queueByDistance.get(dest);
			if (curDist == null) {
				queueByDistance.put(dest, newDist);
				return true;
			}
			else if (newDist < curDist) {
				queueByDistance.put(dest, newDist);
				bestIns.get(dest).clear();
				return true;
			}
			else if (newDist == curDist) {
				return true;
			}
			return false;
		}
Update the record for the given destination with a new offer of shortest distance

<p>
If either the record doesn't exist yet, or the new offer beats the current best, then a
new record is created and replaces the current record. If present, the list of best
inbound edges is cleared -- because they all correspond to a distance that has just been
beat. The node is also added and/or moved forward in the queue of unvisited vertices.

<p>
If the record exists, and the new offer ties the current offer, nothing happens, but the
method still returns true, since the corresponding inbound edge could be optimal.

<p>
If the record's current best beats the offer, nothing happens, and the method returns
false, indicating the inbound edge is definitely not optimal.

@param dest the destination whose record to update
@param newDist the distance offer
@return true iff the offer is equal to or better than the record's current best
Ghidra/Framework/Graph/src/main/java/ghidra/graph/algo/DijkstraShortestPathsAlgorithm.java