This repository contains a Python implementation of an undirected graph using an adjacency list representation and Depth-First Search (DFS) traversal.
- Graph representation using adjacency lists
- Support for undirected edges
- Recursive Depth-First Search (DFS)
- Handles cycles using a visited set
- Includes multiple test cases for demonstration
- Python 3
- Data Structures (Graph)
- Algorithms (Depth-First Search)
- Recursion
- Make sure Python 3 is installed on your system.
- Clone the repository or download the files.
- Run the program using the command below:
python assign3p2.py