// coding · module 16Advanced7 topics · ~8h

Shortest Path va MST

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

0/7 · 0%

This module is Premium

A Premium subscription is required to unlock these lessons. The first 3 modules are free.

Lessons

7 lessons

1Dijkstra algoritmi — eng qisqa yo'l (musbat vaznlar)NOW+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