Example 2: Directed graph (5-6 nodes). Example 3: Network structure (like a grid or small-world). Final Demonstration: Input parsing from stdin or file (matching the C assignment format). Full BFS and ...

To write a Python program to print DFS (Depth-First Search) traversal from a given source vertex in a graph.