Dag of control flow graph

Материал из WikiGrapp
Перейти к:навигация, поиск

Dag of control flow graph --- каркас уграфа.

A dag of a cf-graphG with an initial node p is an acyclic cf-graph D with the initial node p such that V(G)=V(D), A(D)\subseteq A(G) and for any arc u\in A(G)\backslash A(D) the graph D \bigcup \{u\} has a cycle. That is, D is a maximal acyclic subflowgraph.