We will use two data structures:
- visited: This contains all the vertices that have been visited. Initially, it will be empty.
- queue: This contains all the vertices that we have want to visit in next iterations.
We will use two data structures:
3.144.48.135