adplus-dvertising
frame-decoration

Question

Considering a program graph (PG) with statement as vertices and control as edges. Then

a.

PG is always a cyclic

b.

PG is always directed graph

c.

These won’t be any self loops

d.

PG is always a connected graph

Answer: (a).PG is always a cyclic

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Considering a program graph (PG) with statement as vertices and control as edges. Then