Write a program to traverse a graph data structure using queue and stack data structure
Write a program to traverse a graph data structure using queue and stack data structure
Share
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
We have detected that you are using extensions to block ads. Please support us by disabling these ads blocker.
Following question: traversing a graph data structure using queue and stack data structure means we have to implement BFS and DFS.
BFS: It uses a Queue data structure that follows first in first out.
DFS: It uses the Stack data structure, performs two stages, first visited vertices are pushed into the stack, and second if there are no vertices then visited vertices are popped.
The full answer in the below attachment just tap on it: