Graph using DFS only 1. Traversal of the graph 2. No of components in graph 3. Cycle detection in undirected & directed graph 4. Create a Adjacency List ( do not use a array matrix ) 5. DFS 6. BFS 7. Minimum spanning tree (prims algo) 8. Rotten oranges 9.