public void clear() {
		if (size() > 0) {
			edgeIndices.removeAll();
			for (int i = 0; i < capacity; i++) {
				edges[i] = null;
				previousEdgeWithSameFrom[i] = null;
				previousEdgeWithSameTo[i] = null;
				nextEdgeWithSameFrom[i] = null;
				nextEdgeWithSameTo[i] = null;
			}
		}
		nextIndex = 0;
		modificationNumber++;
	}
Empties out the edge set while leaving the capacity alone. Much faster
	  than removing the edges one by one.
Ghidra/Framework/Generic/src/main/java/ghidra/util/graph/EdgeSet.java