@Override
		public int compareTo(ToOpEdge o) {
			Address addr1 = op.getSeqnum().getTarget();
			Address addr2 = o.op.getSeqnum().getTarget();
			int cmp = addr1.compareTo(addr2);
			if (cmp != 0) {
				return cmp;
			}
			int ord1 = op.getSeqnum().getOrder();
			int ord2 = o.op.getSeqnum().getOrder();
			if (ord1 != ord2) {
				return (ord1 < ord2) ? -1 : 1;
			}
			if (slot == o.slot) {
				return 0;
			}
			return (slot < o.slot) ? -1 : 1;
		}
An edge between a Varnode and a PcodeOp

A DynamicHash is defined on a sub-graph of the data-flow, and this defines an edge
in the sub-graph.  The edge can either be from an input Varnode to the PcodeOp
that reads it, or from a PcodeOp to the Varnode it defines.
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/program/model/pcode/DynamicHash.java