Hi i am doing the data structures in C++.
I have seen the adjacency list implementation of depth first search/traversal that is using some recursive function to traverse the whole graph. but not able to find the same for breadth first search/traversal. All the implementation of breadth first are using adjacency matrix using queues. I am not sure if that is possible.
If it is, can somebody give the code snippet of it or provide the link to it.
Thanks
I have seen the adjacency list implementation of depth first search/traversal that is using some recursive function to traverse the whole graph. but not able to find the same for breadth first search/traversal. All the implementation of breadth first are using adjacency matrix using queues. I am not sure if that is possible.
If it is, can somebody give the code snippet of it or provide the link to it.
Thanks