private void makeFragments() {
		fragments = new ArrayList<>();
		for (int side = 0; side < 2; side++) {						// Collect n-grams from both sides
			DataGraph graph = (side == 0 ? graphLeft : graphRight);
			for (DataVertex node : graph.nodeList) {				// for all data-flow vertices
				for (int d = 0; d < node.ngrams.size(); d++) {		// and for every possible depth
					fragments.add(node.ngrams.get(d));				// into one list
				}
			}
		}

		// Sort the list by weight and hash so that possible matches are adjacent
		Collections.sort(fragments);
	}
Creates the sorted list of n-gram hashes used to decide which nodes will get pinned.
Ghidra/Features/CodeCompare/src/main/java/ghidra/features/codecompare/graphanalysis/Pinning.java