Dag of control flow graph

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

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

Литература

• Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.