Specifically, the control flow graph is a directed graph composed of a limited number of nodes and the directed edges between the nodes, wherein the all directed edges are all paths along which the program is possibly executed during the execution process.