CFGNode

abstract def isBasicBlock: Boolean

abstract def isCatchNode: Boolean

abstract def isExitNode: Boolean

abstract def isStartOfSubroutine: Boolean

abstract def nodeId: Int

abstract def toHRR: Option[String]

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def addPredecessor(predecessor: CFGNode): Unit

def addSuccessor(successor: CFGNode): Unit

def asBasicBlock: BasicBlock

def asCatchNode: CatchNode

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(other: Any): Boolean

def finalize(): Unit

final def foreachSuccessor(f: (Node) ⇒ Unit): Unit

final def getClass(): Class[_]

final def hasSuccessors: Boolean

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def predecessors: Set[CFGNode]

def reachable(reflexive: Boolean = false): Set[CFGNode]

Computes the set of all CFGNodes that are reachable from this one.

def removePredecessor(predecessor: CFGNode): Unit

def successors: Set[CFGNode]

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

def visualProperties: Map[String, String]

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit