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
53
defense
tiffany_04192
0
71
Dijkstra’s Algorithm
tiffany_04192
0
110
Topological sort DFS
tiffany_04192
0
90
BFS
tiffany_04192
0
130
DFS
tiffany_04192
0
110
Cache behavior
tiffany_04192
0
82
Cache miss paper
tiffany_04192
0
110
Greedy
tiffany_04192
0
100
Other Decks in Science
See All in Science
傾向スコアによる効果検証 / Propensity Score Analysis and Causal Effect Estimation
ikuma_w
0
130
02_西村訓弘_プログラムディレクター_人口減少を機にひらく未来社会.pdf
sip3ristex
0
610
地質研究者が苦労しながら運用する情報公開システムの実例
naito2000
0
260
Explanatory material
yuki1986
0
400
Machine Learning for Materials (Challenge)
aronwalsh
0
330
機械学習 - K近傍法 & 機械学習のお作法
trycycle
PRO
0
1.2k
機械学習 - 決定木からはじめる機械学習
trycycle
PRO
0
1k
データベース12: 正規化(2/2) - データ従属性に基づく正規化
trycycle
PRO
0
970
機械学習 - K-means & 階層的クラスタリング
trycycle
PRO
0
1k
機械学習 - SVM
trycycle
PRO
1
880
データマイニング - グラフ構造の諸指標
trycycle
PRO
0
170
mathematics of indirect reciprocity
yohm
1
180
Featured
See All Featured
For a Future-Friendly Web
brad_frost
180
9.9k
How STYLIGHT went responsive
nonsquared
100
5.8k
The Art of Delivering Value - GDevCon NA Keynote
reverentgeek
15
1.7k
Code Review Best Practice
trishagee
71
19k
Why You Should Never Use an ORM
jnunemaker
PRO
59
9.5k
How To Stay Up To Date on Web Technology
chriscoyier
790
250k
Build The Right Thing And Hit Your Dates
maggiecrowley
37
2.9k
Practical Orchestrator
shlominoach
190
11k
Embracing the Ebb and Flow
colly
87
4.8k
10 Git Anti Patterns You Should be Aware of
lemiorhan
PRO
656
61k
The Illustrated Children's Guide to Kubernetes
chrisshort
48
50k
Practical Tips for Bootstrapping Information Extraction Pipelines
honnibal
PRO
23
1.4k
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