GitHub / TebogoYungMercykay / Controll_Flow_Graph_Implementation_In_Java
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.
Stars: 2
Forks: 0
Open issues: 0
License: None
Language: Java
Size: 83 KB
Dependencies parsed at: Pending
Created at: about 2 years ago
Updated at: 10 months ago
Pushed at: almost 2 years ago
Last synced at: 3 months ago
Topics: control-flow-graph, cost, data-structures-and-algorithms, directed-graphs, distance, edges, graphs, java, length, nodes, object-oriented-programming, paths, prime-paths, shortest-paths, simple-path, vertices, weighted-graphs