Computer Science, asked by nirakhi7469, 1 year ago

Explain dijkastra's algorithm with suitable examples

Answers

Answered by boxa2

Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. ... For a given source node in the graph, the algorithm finds the shortest path between that node and every other.

Previous Question

Next Question

Similar questions

Math, 7 months ago

the distance of the point (0,6) from orign ...

Biology, 7 months ago

What happens when planaria gets cut into pieces ???

Math, 7 months ago

its the question of ch polynomials class 10 all in one maths...

Science, 1 year ago

What is the role of nasal cavity in human respiratory system?

Social Sciences, 1 year ago

Explain the various factors that affect the land use pattern...

Science, 1 year ago

There was no oxygen in space so how can a rockets fuel burn and accelerate the rocket...

English, 1 year ago

Explain the phrase 'picked on me'.

Chemistry, 1 year ago

The compound formed when ethanol reacts with sodium is ..........................(sodium ethanoate,sodium ethoxide,sodium propanate)...