// coding · modul 16Yuqori7 mavzu · ~8 soat

Shortest Path va MST

Dijkstra, Bellman-Ford, Floyd-Warshall, Prim, Kruskal, LCA.

0/7 · 0%

Bu modul — Premium

Darslarni ochish uchun Premium obuna kerak. Dastlabki 3 ta modul bepul.

Darslar

7 ta dars

1Dijkstra algoritmi — eng qisqa yo'l (musbat vaznlar)HOZIR+10

2Bellman-Ford algoritmi — manfiy vaznlar va tsikllar+10

3Floyd-Warshall algoritmi — hamma nuqtadan hamma nuqtaga+10

4Minimal Darax (Minimum Spanning Tree - MST)+10

5Kruskal algoritmi — DSU bilan MST+10

6Prim algoritmi — PQ bilan MST+10

7Shortest Path va MST yakuniy masalalar+10