Upgrade to PRO for Only $50/Year—Limited-Time Offer! 🔥
Speaker Deck
Features
Speaker Deck
PRO
Sign in
Sign up for free
Search
Search
Floyd-Warshall
Search
Chen
November 17, 2022
Science
0
89
Floyd-Warshall
Chen
November 17, 2022
Tweet
Share
More Decks by Chen
See All by Chen
Example ROP in MIPS
tiffany_04192
0
57
defense
tiffany_04192
0
72
Dijkstra’s Algorithm
tiffany_04192
0
110
Topological sort DFS
tiffany_04192
0
92
BFS
tiffany_04192
0
130
DFS
tiffany_04192
0
120
Cache behavior
tiffany_04192
0
83
Cache miss paper
tiffany_04192
0
110
Greedy
tiffany_04192
0
110
Other Decks in Science
See All in Science
AIによる科学の加速: 各領域での革新と共創の未来
masayamoriofficial
0
320
データマイニング - グラフ埋め込み入門
trycycle
PRO
1
130
白金鉱業Meetup_Vol.20 効果検証ことはじめ / Introduction to Impact Evaluation
brainpadpr
2
1.5k
会社でMLモデルを作るとは @電気通信大学 データアントレプレナーフェロープログラム
yuto16
1
460
MCMCのR-hatは分散分析である
moricup
0
540
KH Coderチュートリアル(スライド版)
koichih
1
55k
機械学習 - K-means & 階層的クラスタリング
trycycle
PRO
0
1.2k
タンパク質間相互作⽤を利⽤した⼈⼯知能による新しい薬剤遺伝⼦-疾患相互作⽤の同定
tagtag
0
130
データベース11: 正規化(1/2) - 望ましくない関係スキーマ
trycycle
PRO
0
1k
データから見る勝敗の法則 / The principle of victory discovered by science (open lecture in NSSU)
konakalab
1
250
データマイニング - グラフデータと経路
trycycle
PRO
1
260
Ignite の1年間の軌跡
ktombow
0
190
Featured
See All Featured
Keith and Marios Guide to Fast Websites
keithpitt
413
23k
How To Stay Up To Date on Web Technology
chriscoyier
791
250k
Making Projects Easy
brettharned
120
6.5k
How to make the Groovebox
asonas
2
1.8k
Kristin Tynski - Automating Marketing Tasks With AI
techseoconnect
PRO
0
110
Un-Boring Meetings
codingconduct
0
160
jQuery: Nuts, Bolts and Bling
dougneiner
65
8.3k
Intergalactic Javascript Robots from Outer Space
tanoku
273
27k
Noah Learner - AI + Me: how we built a GSC Bulk Export data pipeline
techseoconnect
PRO
0
74
Game over? The fight for quality and originality in the time of robots
wayneb77
1
66
From π to Pie charts
rasagy
0
91
The innovator’s Mindset - Leading Through an Era of Exponential Change - McGill University 2025
jdejongh
PRO
1
69
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