Computer Science, asked by Shivank3874, 1 year ago

Explain Dijkstra’s algorithm in detail.

Answers

Answered by hanthi

0

Dijkstra's algorithm (or Dijkstra's Shortest Path First algorithm, SPF algorithm) is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later.

Previous Question

Next Question

Similar questions

Math, 6 months ago

M B. C 21. The interior angles of a triangle are in the ratio 2:3:5. Find all the angles. Is this a right triangle...

Math, 6 months ago

1. Find d(A,B), if co-ordinates of A and B are -2 and -5 respectively.

Social Sciences, 6 months ago

explain in detail the two stages of the russian revolution in 1917...

Physics, 1 year ago

Explain Dijkastra’s algorithm and find shortest path for the following graph.

Physics, 1 year ago

Explain DMA interfacing with processor.

English, 1 year ago

synonyms of steadfast...

English, 1 year ago

article of 600 words on the topic "There is a wisdom of the head and a wisdom of the heart...

CBSE BOARD X, 1 year ago

find the square of the following using column method 1).26...