Register

BFS algorithm

368 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

998
views
1 answers
0 votes
iarnav asked May 29, 2017
998 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!
User Avatar
378
views
1 answers
0 votes
Subbu. asked Jul 16, 2022
378 views
#Dfs And Bfs
Please list the problems where BFS alone can do and DFS alone can do and both can do??
User Avatar
927
views
2 answers
1 votes
saptarshiDey asked Feb 1, 2019
927 views
BFS traversal path
What will be the path from A-H if BFS is used in the following graph?
User Avatar
1.5k
views
0 answers
1 votes
Markzuck asked Dec 30, 2018
1,470 views
BFS and DFS - types of edges
Can someone please explain what are the types of edges possible in BFS and DFS for DIRECTED as well as UNDIRECTED graphs?Individual meaning of BACK, FRONT ... Traversals.an example would be of great help or any specific reference on this.
User Avatar
Link Copied!