shortest path - 8 | Big Dijkstra Energy

Share this series
and show support for the creator!

like CountLike
Subscribe
Subscribed to your list Unsubscribed for your list
Facebook
Twitter
Tumblr
Reddit
URL COPY
The URL has been copied.
Paste(Ctrl+V) it in the desired location.

Report

Do you want to report this series
as inappropriate content?

If you’d like to report copyright infringement,
click here.

Yes No

You've already
reported
this episode.

Report completed.
Thank you!

queue-tea
test cases
markov chain
avl tree
binary tree
code, compile, cry ❤️
fft
shortest path
hash collision
git checkout
p-value
np-complete
bandit
bae-sian model
callback
data race
minimax
stable matching
prime pair
Leaving U with my Eigenvalue
Commute with me? ;D
You are the *1* that I want
a-simp-tote
convnet
segfault
latent space
one hot encoding
pytorch
U-Substitute
Math Puns
Mobius Strip
Integral
State of the Art
Induction
Attention
Right Hand Rule
Bashful
I Choose U
NPComplete
Jeffrey's Prior
Sunk Cost

Previous Recurrence Next Recurrence

Creator

dijkstradaddy

Ropeless Homantic wants to find the shortest path to Priority queuetie’s heart in O(vlogv+e) time. When crossing each edge e_i, there is a p_i chance that Ropeless says something dumb and messes up their chances with priority. Find the path that maximizes the probability that Ropeless does not say something dumb.