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
89
Floyd-Warshall
Chen
November 17, 2022
Tweet
Share
More Decks by Chen
See All by Chen
Example ROP in MIPS
tiffany_04192
0
59
defense
tiffany_04192
0
73
Dijkstra’s Algorithm
tiffany_04192
0
120
Topological sort DFS
tiffany_04192
0
92
BFS
tiffany_04192
0
130
DFS
tiffany_04192
0
120
Cache behavior
tiffany_04192
0
84
Cache miss paper
tiffany_04192
0
110
Greedy
tiffany_04192
0
110
Other Decks in Science
See All in Science
データマイニング - グラフ構造の諸指標
trycycle
PRO
0
240
ド文系だった私が、 KaggleのNCAAコンペでソロ金取れるまで
wakamatsu_takumu
2
1.9k
AI(人工知能)の過去・現在・未来 —AIは人間を超えるのか—
tagtag
PRO
1
230
機械学習 - K近傍法 & 機械学習のお作法
trycycle
PRO
0
1.3k
MCMCのR-hatは分散分析である
moricup
0
570
次代のデータサイエンティストへ~スキルチェックリスト、タスクリスト更新~
datascientistsociety
PRO
2
25k
良書紹介04_生命科学の実験デザイン
bunnchinn3
0
110
あなたに水耕栽培を愛していないとは言わせない
mutsumix
1
160
データマイニング - グラフ埋め込み入門
trycycle
PRO
1
150
知能とはなにかーヒトとAIのあいだー
tagtag
PRO
0
170
データベース15: ビッグデータ時代のデータベース
trycycle
PRO
0
420
白金鉱業Meetup_Vol.20 効果検証ことはじめ / Introduction to Impact Evaluation
brainpadpr
2
1.6k
Featured
See All Featured
Bootstrapping a Software Product
garrettdimon
PRO
307
120k
For a Future-Friendly Web
brad_frost
180
10k
Design in an AI World
tapps
0
130
Designing Experiences People Love
moore
143
24k
RailsConf 2023
tenderlove
30
1.3k
The World Runs on Bad Software
bkeepers
PRO
72
12k
Large-scale JavaScript Application Architecture
addyosmani
515
110k
Kristin Tynski - Automating Marketing Tasks With AI
techseoconnect
PRO
0
120
Why Mistakes Are the Best Teachers: Turning Failure into a Pathway for Growth
auna
0
44
The Illustrated Guide to Node.js - THAT Conference 2024
reverentgeek
0
230
Embracing the Ebb and Flow
colly
88
5k
The Web Performance Landscape in 2024 [PerfNow 2024]
tammyeverts
12
1k
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