This C++ project implements a basic graph structure and performs Breadth-First Search (BFS) traversal. The program defines a graph using adjacency lists and allows the addition of edges between vertices. A user can input a starting vertex, and the program will traverse the graph using BFS, visiting each vertex level by level. The graph is represented with a vector of vectors, and a queue is used for BFS traversal, ensuring efficient exploration of all nodes.
- Graph representation using adjacency lists.
- BFS traversal for graph exploration.
- Edge addition functionality for building dynamic graphs.