if(ih instanceof BranchHandle) {
//ok, now we need to replace existing successor edges appropriately.
BranchHandle bh = (BranchHandle)ih;
List<InstructionHandle> successors = igc.getSuccessors(ih);
TreeSet<InstructionHandle> orderedSuccessors = new TreeSet<InstructionHandle>(new InstructionComparator());
orderedSuccessors.addAll(successors);
if(successors.size() == 2) {
//lowest will be true condition....
IntermediateEdge truePath = igc.getGraph().getEdge(ih, orderedSuccessors.first());