Graph Algorithm 15
- Option : A
- Explanation :
Maximum DFS recurside depth is 19
A → B → C → D → E → F → G → H → I → J → K
→ L → M → N → O → P → Q → R → S
You must be logged in to post a comment.
Maximum DFS recurside depth is 19
A → B → C → D → E → F → G → H → I → J → K
→ L → M → N → O → P → Q → R → SYou must be logged in to post a comment.
You must be logged in to post a comment.