q02IsDagP

solutions.q02IsDagP

Question 2

Given the following directed graph, algorithmically determine if it is a DAG. If it is not, explain why.

\(\{A\to B,\; B\to C,\; C\to A,\; B\to D\}\)

Functions:

Name	Description
q02IsDagP	Args:

q02IsDagP(G)

Parameters:

Name	Type	Description	Default
G	Graph	Graph resolves into G.V and G.E.	required