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
研究って何だっけ / What is Research?
ks91
PRO
1
140
【論文紹介】Is CLIP ideal? No. Can we fix it?Yes! 第65回 コンピュータビジョン勉強会@関東
shun6211
5
1.6k
Gemini Prompt Engineering: Practical Techniques for Tangible AI Outcomes
mfonobong
2
190
タンパク質間相互作⽤を利⽤した⼈⼯知能による新しい薬剤遺伝⼦-疾患相互作⽤の同定
tagtag
0
110
データベース08: 実体関連モデルとは?
trycycle
PRO
0
980
データマイニング - グラフ埋め込み入門
trycycle
PRO
1
110
Ignite の1年間の軌跡
ktombow
0
170
蔵本モデルが解き明かす同期と相転移の秘密 〜拍手のリズムはなぜ揃うのか?〜
syotasasaki593876
1
140
データベース04: SQL (1/3) 単純質問 & 集約演算
trycycle
PRO
0
1k
データベース02: データベースの概念
trycycle
PRO
2
960
2025-05-31-pycon_italia
sofievl
0
100
データベース01: データベースを使わない世界
trycycle
PRO
1
870
Featured
See All Featured
Facilitating Awesome Meetings
lara
57
6.6k
CoffeeScript is Beautiful & I Never Want to Write Plain JavaScript Again
sstephenson
162
15k
Visualization
eitanlees
150
16k
Understanding Cognitive Biases in Performance Measurement
bluesmoon
31
2.7k
Scaling GitHub
holman
463
140k
The Straight Up "How To Draw Better" Workshop
denniskardys
239
140k
Six Lessons from altMBA
skipperchong
29
4.1k
Designing for humans not robots
tammielis
254
26k
Fight the Zombie Pattern Library - RWD Summit 2016
marcelosomers
234
17k
Fantastic passwords and where to find them - at NoRuKo
philnash
52
3.5k
Exploring the Power of Turbo Streams & Action Cable | RailsConf2023
kevinliebholz
36
6.1k
[RailsConf 2023 Opening Keynote] The Magic of Rails
eileencodes
31
9.8k
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