DRAFT
ZeroInEdges
Misconception:
A CFG can contain nodes (in addition to the entry node) that are not pointed to by any arrows.
Incorrect
A control-flow graph node (other than the entry node) can have zero incoming edges
Correct
Except of the entry node, all control-flow graph nodes have incoming edges
CorrectionHere is what's right.
Here is what's right.
There must be at least one incoming edge for any node except the entry node (which we draw as a circle containing an “e”). All diamonds and rectangles must have an incoming arrow, because all nodes must be reachable from the entry node (otherwise they would represent unreachable code, which the compiler would reject with an error).
Language
Java
Notional Machine
ControlFlowAsGraph