Upgrade to Pro
— share decks privately, control downloads, hide ads and more …
Speaker Deck
Features
Speaker Deck
PRO
Sign in
Sign up for free
Search
Search
Floyd-Warshall
Search
Chen
November 17, 2022
Science
96
0
Share
Floyd-Warshall
Chen
November 17, 2022
More Decks by Chen
See All by Chen
Example ROP in MIPS
tiffany_04192
0
63
defense
tiffany_04192
0
74
Dijkstra’s Algorithm
tiffany_04192
0
120
Topological sort DFS
tiffany_04192
0
95
BFS
tiffany_04192
0
130
DFS
tiffany_04192
0
120
Cache behavior
tiffany_04192
0
88
Cache miss paper
tiffany_04192
0
120
Greedy
tiffany_04192
0
110
Other Decks in Science
See All in Science
ハミルトン・ヤコビ方程式の解の性質と物理的意味
enakai00
0
360
Physical AIを支えるWeights & Biases
olachinkei
1
310
あなたに水耕栽培を愛していないとは言わせない
mutsumix
1
320
NDCG is NOT All I Need
statditto
2
3.1k
主成分分析に基づく教師なし特徴抽出法を用いたコラーゲン-グリコサミノグリカンメッシュの遺伝子発現への影響
tagtag
PRO
0
250
Vibecoding for Product Managers
ibknadedeji
0
160
PPIのみを用いたAIによる薬剤–遺伝子–疾患 相互作用の同定
tagtag
PRO
0
210
見上公一.pdf
genomethica
0
130
(メタ)科学コミュニケーターからみたAI for Scienceの同床異夢
rmaruy
0
220
機械学習 - pandas入門
trycycle
PRO
0
580
Algorithmic Aspects of Quiver Representations
tasusu
0
320
Text-to-SQLの既存の評価指標を問い直す
gotalab555
1
210
Featured
See All Featured
Organizational Design Perspectives: An Ontology of Organizational Design Elements
kimpetersen
PRO
1
690
Become a Pro
speakerdeck
PRO
31
5.9k
Public Speaking Without Barfing On Your Shoes - THAT 2023
reverentgeek
1
380
技術選定の審美眼(2025年版) / Understanding the Spiral of Technologies 2025 edition
twada
PRO
118
110k
GraphQLとの向き合い方2022年版
quramy
50
15k
Crafting Experiences
bethany
1
140
10 Git Anti Patterns You Should be Aware of
lemiorhan
PRO
659
62k
How to Ace a Technical Interview
jacobian
281
24k
Self-Hosted WebAssembly Runtime for Runtime-Neutral Checkpoint/Restore in Edge–Cloud Continuum
chikuwait
0
510
A Tale of Four Properties
chriscoyier
163
24k
Building a Modern Day E-commerce SEO Strategy
aleyda
45
9k
Highjacked: Video Game Concept Design
rkendrick25
PRO
1
350
Transcript
Floyd-Warshall: Dynamic Programming Floyd-Warshall computes all pairs, but let us
focus on 5 to 6. 62 / 71
Floyd-Warshall: Dynamic Programming We start by considering only start(5) and
dest(6) when k is 0. 63 / 71
Floyd-Warshall: Dynamic Programming Then we also consider node 1 when
k is 1. 64 / 71
Floyd-Warshall: Dynamic Programming And node 2 when k is 2.
65 / 71
Floyd-Warshall: Dynamic Programming And node 3 when k is 3.....
66 / 71
Floyd-Warshall: Dynamic Programming And node 4 when k is 4....
And so on. Note that I have just been filling in the answers for recursive calls But we actually need to compute those. 67 / 71
Floyd-Warshall: Dynamic Programming Hmm it looks like some of those
recursive calls will recompute the same thing... 68 / 71