Intro about me
How to find your true love?
Best choice problem
Elo score
Gale–Shapley algorithm
Implementation
What for?
Story of my success
For practice link
Let's be focused
Dijkstra's algorithm
The lack of implementation of proper priority queue
The code is slow, due to 1 reason:
Can we do better?
Bellman - Ford algorithm
if (d[u] + c(u,v) < d[v])
d[v] = d[u] + c(u,v)Condition
| Bellman Ford | 104 ms | 41 MB | O ( |V|⋅|E| ) |
|---|---|---|---|
| Dijkstra Algorithm | 136 ms | 45.4 MB | О(V log V) |
Compare
My point is...
Good luck and have fun
deck
By Khrystyna Landvytovych
