Correctness of Dijkstra Algorithm - Simplified

Подписаться 19

Просмотров 4,8 тыс.

50% 1

In this video, we will prove Dikstra correctness in a simple and intuitive manner. The formal proof shared in textbooks requires a deep understanding of underlying theorems and hence, I have made an attempt to present the details in a simple manner for other`s benefits. Feel free to like and subscribe, if it helps you.

Опубликовано:

8 сен 2024

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 8

@roottwo5459 3 года назад

This is actually the most clear explanation I've seen on this topic tbh.

@learnersparadise7492 3 года назад

Thanks. appreciate the input. It motivates me to create more videos like this. Please like and subscribe ❤️❤️

@indistantdreams 2 месяца назад

Thank you

@learnersparadise7492 23 дня назад

Welcome

@AKGamersLite 2 года назад

My professor showed us dijkstra proof of correctness and he made it very complicated, but this video was so easy to understand. I appreciate making this video brother

@learnersparadise7492 2 года назад

Thanks 🙏🙏. It's really motivating to see that you are benefitted. Please do like and subscribe. I am planning to create many more videos around computer science fundamentals.

@cc9891 3 года назад

It's clear for me that if we have d(v) ≤ d(y) and d(v) ≥ d(y) it implies that d(v) = d(y). But I think it's also possible that there is an arc with weight 0 between v and y (in the special case that v is not equal to y but d(v) = d(y))? So I think v is only equal to y if the arcs have weights > 0. The proof holds anyways but I want to know if my view is correct.

@learnersparadise7492 3 года назад

That's correct.