Graph Algorithm 17
- Option : C
- Explanation : Applying BFS Algorithms
Starting from Q
Queue Q
Making Q’s child’s status 1.
Queue
Q| M| N| P
Making M’s child 1 (which are not 1)
Q| M| N| P| R Making N’s Child 1 Q| M| N| P| R| O (other are already 1)Status Q M N O P R 2 1 1 1 2 2 1 1 1 2 2 2 1 1 1
You must be logged in to post a comment.
You must be logged in to post a comment.