in Algorithms recategorized by
334 views
1 vote
1 vote

Consider the following graph.

  1. How many nodes (apart from $s$) does the Breadth First Search algorithm discover before discovering $t$ when starting from $s$.
in Algorithms recategorized by
by
334 views

1 comment

Kindly help @gatecse sir
0
0

Please log in or register to answer this question.

Related questions