org.argus.jawa.alir.controlFlowGraph
(We ASSUME that predecessors ???? and successors of n are within the same method as of n) So, this algorithm is only for an internal node of a method NOT for a method's Entry node or Exit node The algorithm is obvious from the following code