Description
GRAPH:1
GRAPH : 2
(i) Represent the graphs using adjacency matrix or adjacency list.
(ii) Perform Depth first search (DFS) and Breadth first search (BFS) traversals by
considering the start vertices as ‘A’ and ‘0’ for Graph 1 and Graph 2
respectively.
