How to apply Dijkstra's algorithm?

T

T

The_XXI2019-10-03 00:46:05

Algorithms

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

How to apply Dijkstra's algorithm?

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

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

D

Danil Kumarov2017-06-23 20:11:32

How can you get other font-weight fonts from one regular? 2Reply

D

DarkOracleLex2020-09-29 17:16:22

What am I doing wrong in the test task? 1Reply

P

progerstas2020-09-30 18:46:37

What type of labyrinths to choose and what algorithm to use? 1Reply

R

rxecore2018-12-04 10:29:34

How to prepare the base for a neural network? 2Reply

V

Vladimir Korovin2016-07-06 23:30:24

Algorithm for creating a sequence over multiple values? 3Reply

Didn't find what you were looking for?

Ask your question

Ask a Question

731 491 924 answers to any question