How to apply Dijkstra's algorithm?

T

The_XXI2019-10-03 00:46:05

Algorithms

The_XXI, 2019-10-03 00:46:05

Tell me how to find the shortest path from s to t, more precisely, how to explain that it is the shortest using Dijkstra's algorithm?

Reply

Answer the question

In order to leave comments, you need to log in

1 answer(s)

R

Ruslan., 2019-10-03
@The_XXI

Here is a proof of the correctness of Dijkstra's algorithm.
It also describes why the path is the shortest.
https://neerc.ifmo.ru/wiki/index.php?title=%D0%90%...

Similar questions

E

e1s2015-05-26 11:24:41

How to get rid of ban (number of questions) on stackoverflow.com? 2Reply

D

Den5552019-04-25 20:42:21

Learning algorithmic thinking? 5Reply

F

Fedor Malyshkin2014-12-04 01:39:34

Is there an algorithm for maximum text coverage by available substrings? 2Reply

S

Sergey2016-12-01 15:14:07

Generate M unique random numbers ranging from 1..N. Is there a fast algorithm? 3Reply

M

misantropisk2014-12-05 23:12:22

Please demonstrate a recursive algorithm for finding the Euler function (preferably in C / C ++, but also in pseudocode)? 1Reply

Didn't find what you were looking for?

Ask your question