private void removeInEdge(DataVertex node, int inEdge) {
		DataVertex inNode = node.sources.get(inEdge);
		int outEdge;
		for (outEdge = 0; outEdge < inNode.sinks.size(); outEdge++) {
			if (inNode.sinks.get(outEdge) == node) {
				break;
			}
		}
		node.sources.remove(inEdge);

		int n = inNode.sinks.size();
		if (n != 0) {
			inNode.sinks.remove(outEdge);
		}
	}
Remove an edge between the given node and one of its inputs.
@param node is the given node
@param inEdge is the input edge
Ghidra/Features/CodeCompare/src/main/java/ghidra/features/codecompare/graphanalysis/DataGraph.java