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
0
87
Floyd-Warshall
Chen
November 17, 2022
Tweet
Share
More Decks by Chen
See All by Chen
Example ROP in MIPS
tiffany_04192
0
55
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
110
Cache behavior
tiffany_04192
0
83
Cache miss paper
tiffany_04192
0
110
Greedy
tiffany_04192
0
100
Other Decks in Science
See All in Science
Celebrate UTIG: Staff and Student Awards 2025
utig
0
280
テンソル分解による糖尿病の組織特異的遺伝子発現の統合解析を用いた関連疾患の予測
tagtag
2
280
データベース10: 拡張実体関連モデル
trycycle
PRO
0
1k
SciPyDataJapan 2025
schwalbe10
0
270
MCMCのR-hatは分散分析である
moricup
0
480
システム数理と応用分野の未来を切り拓くロードマップ・エンターテインメント(スポーツ)への応用 / Applied mathematics for sports entertainment
konakalab
1
410
高校生就活へのDA導入の提案
shunyanoda
0
6k
Explanatory material
yuki1986
0
410
機械学習 - 決定木からはじめる機械学習
trycycle
PRO
0
1.1k
データベース05: SQL(2/3) 結合質問
trycycle
PRO
0
820
アナログ計算機『計算尺』を愛でる Midosuji Tech #4/Analog Computing Device Slide Rule now and then
quiver
1
310
機械学習 - SVM
trycycle
PRO
1
910
Featured
See All Featured
Let's Do A Bunch of Simple Stuff to Make Websites Faster
chriscoyier
508
140k
Keith and Marios Guide to Fast Websites
keithpitt
411
23k
個人開発の失敗を避けるイケてる考え方 / tips for indie hackers
panda_program
116
20k
Java REST API Framework Comparison - PWX 2021
mraible
34
8.9k
The Psychology of Web Performance [Beyond Tellerrand 2023]
tammyeverts
49
3.1k
The Cult of Friendly URLs
andyhume
79
6.6k
CoffeeScript is Beautiful & I Never Want to Write Plain JavaScript Again
sstephenson
162
15k
Raft: Consensus for Rubyists
vanstee
140
7.2k
Build The Right Thing And Hit Your Dates
maggiecrowley
38
2.9k
Building an army of robots
kneath
305
46k
Scaling GitHub
holman
463
140k
Distributed Sagas: A Protocol for Coordinating Microservices
caitiem20
333
22k
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