nodeSet = new TreeSet<BasicBlock>(); outgoingEdgeMap = new TreeMap<Edge, Edge>(); incomingEdgeMap = new TreeMap<Edge, Edge>(incomingEdgeComparator); entry = allocate(); exit = allocate(); }
blockList = new ArrayList<BasicBlock>(); edgeList = new ArrayList<Edge>(); entry = allocate(); exit = allocate(); firstEdgeId = maxEdgeId = 0; }
    public CFG() {	nodeSet = new TreeSet<BasicBlock>();	outgoingEdgeMap = new TreeMap<Edge, Edge>();	incomingEdgeMap = new TreeMap<Edge, Edge>(incomingEdgeComparator);	entry = allocate();	exit = allocate();    }