Register

BFS algorithm

345 views
0 votes
0 votes
$State \ TRUE \ OR \ FALSE :\\ Given \ an \ undirected \ connected \ graph \ with \ binary \ edge \ weights \ the \\ shortest \ path \ b/w \ any \ two \ nodes \ can \ be \ found \ in \ O(E)?$
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
iarnav asked May 29, 2017
968 views
BFS algorithm simple question
BFS algo is applied on graph as well as Binary tree. So, is it different for both graph and Binary tree? As on youtube some people showing BFS on graph and some on Binary tree. Kindly clarify, thanks!
BFS algo is applied on graph as well as Binary tree. So, is it different for both graph and Binary tree?As on youtube some people showing BFS on graph and some on Binary ...
User Avatar
0 votes
0 votes
1 answer
2
Subbu. asked Jul 16, 2022
348 views
#Dfs And Bfs
Please list the problems where BFS alone can do and DFS alone can do and both can do??
Please list the problems where BFS alone can do and DFS alone can do and both can do??
User Avatar
1 votes
1 votes
2 answers
3
saptarshiDey asked Feb 1, 2019
864 views
BFS traversal path
What will be the path from A-H if BFS is used in the following graph?
What will be the path from A-H if BFS is used in the following graph?
User Avatar
Link Copied!