private static PotentialPair findFirstUnconflictedPair(
			ArrayList<PotentialPair> potentialPairs) {
		Collections.sort(potentialPairs);			// Sort pairs based on score
		int lastIndex = potentialPairs.size() - 1;
		while (lastIndex >= 0) {
			double score = potentialPairs.get(lastIndex).getScore();
			int firstIndex = lastIndex - 1;
			while (firstIndex >= 0 && potentialPairs.get(firstIndex).getScore() >= score) {
				firstIndex -= 1;
			}
			PotentialPair bestPair = unconflictedPair(potentialPairs, firstIndex + 1, lastIndex);
			if (bestPair != null) {
				return bestPair;
			}
			lastIndex = firstIndex;
		}

		return PotentialPair.EMPTY_PAIR;	// No match found. We get here in the case of conflict-only matrices.	
	}
Find the first PotentialPair where there is no conflict.
Sort the pairs based on score, and divide them into ranges of equal score.
Look for the first PotentialPair whose source and dest are not involved with any
other pair within an equal score range.
@param potentialPairs is the array of pairs
@return the first (highest scoring) unconflicted pair (or null)
Ghidra/Features/VersionTrackingBSim/src/main/java/ghidra/feature/vt/api/BSimProgramCorrelatorMatching.java