Student ID:

Q$3$: Do as directed $($attempt any six questions$).$

Marks $(24)$

I. Draw the incidence matrix for the following graph.

II$.$ Apply the BFS algorithm, the starting point is $"0",$ then traverse all other vertices step by step.

III. Detect a cycle in a directed graph $()$ step by step.

Flag:

$-1$ mean unvisited $0$ Visited & in stack $1$ Visited & popped out

IV$.$ Consider the following directed acyclic graph and apply the topological sort step by step.