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
Sponsored
·
Your Podcast. Everywhere. Effortlessly.
Share. Educate. Inspire. Entertain. You do you. We'll handle the rest.
→
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
60
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
知能とはなにかーヒトとAIのあいだー
tagtag
PRO
0
140
凸最適化からDC最適化まで
santana_hammer
1
350
コンピュータビジョンによるロボットの視覚と判断:宇宙空間での適応と課題
hf149
1
530
機械学習 - ニューラルネットワーク入門
trycycle
PRO
0
940
データベース14: B+木 & ハッシュ索引
trycycle
PRO
0
660
Hakonwa-Quaternion
hiranabe
1
170
NASの容量不足のお悩み解決!災害対策も兼ねた「Wasabi Cloud NAS」はここがスゴイ
climbteam
1
330
Cross-Media Technologies, Information Science and Human-Information Interaction
signer
PRO
3
32k
Lean4による汎化誤差評価の形式化
milano0017
1
430
AIによる科学の加速: 各領域での革新と共創の未来
masayamoriofficial
0
410
Agent開発フレームワークのOverviewとW&B Weaveとのインテグレーション
siyoo
0
410
データベース15: ビッグデータ時代のデータベース
trycycle
PRO
0
440
Featured
See All Featured
It's Worth the Effort
3n
188
29k
Scaling GitHub
holman
464
140k
WENDY [Excerpt]
tessaabrams
9
36k
How to Talk to Developers About Accessibility
jct
2
130
How Software Deployment tools have changed in the past 20 years
geshan
0
32k
Navigating Weather and Climate Data
rabernat
0
110
Discover your Explorer Soul
emna__ayadi
2
1.1k
エンジニアに許された特別な時間の終わり
watany
106
230k
Cheating the UX When There Is Nothing More to Optimize - PixelPioneers
stephaniewalter
287
14k
Claude Code どこまでも/ Claude Code Everywhere
nwiizo
61
52k
Put a Button on it: Removing Barriers to Going Fast.
kastner
60
4.2k
Intergalactic Javascript Robots from Outer Space
tanoku
273
27k
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