1. Write a Algorithm and C code of DFS and BFS using (a) Array & (b) Linked List. Analysis the algorithm using Space and Time.
2. Connected Component Analysis: Given an undirected graph, develop an algorithm using BFS to identify and separate the graph into its constituent connected components. A connected component is a subgraph where every vertex is reachable from every other vertex by following edges.
3. Cycle Detection: Design an algorithm utilizing DFS to determine if an undirected graph contains any cycles. A cycle is a path that starts and ends at the same vertex, traversing edges without repetition (except for the starting vertex).
Sample Code of the Graph (GraphCreationOld.c) : https://drive.google.com/file/d/1ZDLUOc0qSsjnqXOAZiGvWHstjbo0aqeU/view?usp=sharing