Computer Science, asked by sethprathamesh33, 11 months ago

Does bfs always has the shortest path from start state to goal state.

Answers

Answered by benhurmuthu

0

Explanation:

Shortest Path from a given source to destination. ... We say that BFS is the algorithm to use if we want to find the shortest path in an undirected, unweighted graph. The claim for BFS is that the first time a node is discovered during the traversal, that distance from the source would give us the shortest pat

Previous Question

Next Question

Similar questions

Social Sciences, 6 months ago

why is dramatic art of ancient india considered as images of social life?

English, 6 months ago

Summer games of west bangle ...

Science, 6 months ago

derive the formula for potential energy work = force × ____ w = ___ × h w = _______...

Biology, 11 months ago

Distinguish between communicable and non communicable diseases...

Physics, 11 months ago

A projectile takes off with an initial velocity of 10 m/s at an angle of elevation of 45...

English, 1 year ago

The teacher said to the student,"Why are you making so much noice in the class room"...

Math, 1 year ago

Select the statement that best justifies the conclusion based on the given information. If x + 5 = 15, then x = 10. addition property of equality subtraction property of equality multiplication property of equality substitution...

Math, 1 year ago

Which is the ordered pair for the point on the x-axis that is on the line parallel to the given line and through the given point (–6, 10)? (6, 0) (0, 6) (−5, 0) (0, −5)...