recategorized by
327 views
1 votes
1 votes

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$.
recategorized by

Please log in or register to answer this question.

Related questions

1 votes
1 votes
1 answer
1
admin asked Dec 15, 2022
242 views
Consider the following graph.How many nodes (apart from $s$) does the Depth First Search algorithm discover before discovering $t$ when starting from $s.$
2 votes
2 votes
0 answers
4
admin asked Dec 15, 2022
226 views
How many topological sortings (or topological orderings) does the given directed graph have?