A CFG is known as a Single Entry Single Exit (SESE) graph if it only has a single entry node and a single exit node. A problem that arose during researchon static analysis is how to deal with loops in the CFG.
java paths graphs distance edges control-flow-graph cost shortest-paths nodes vertices directed-graphs length object-oriented-programming weighted-graphs data-structures-and-algorithms simple-path prime-paths
-
Updated
Jul 19, 2023 - Java