Lock in $30 Savings on PRO—Offer Ends Soon! ⏳
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
57
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
120
Cache behavior
tiffany_04192
0
83
Cache miss paper
tiffany_04192
0
110
Greedy
tiffany_04192
0
110
Other Decks in Science
See All in Science
中央大学AI・データサイエンスセンター 2025年第6回イブニングセミナー 『知能とはなにか ヒトとAIのあいだ』
tagtag
0
100
KH Coderチュートリアル(スライド版)
koichih
1
55k
機械学習 - K-means & 階層的クラスタリング
trycycle
PRO
0
1.2k
Accelerated Computing for Climate forecast
inureyes
PRO
0
140
データベース04: SQL (1/3) 単純質問 & 集約演算
trycycle
PRO
0
1.1k
Optimization of the Tournament Format for the Nationwide High School Kyudo Competition in Japan
konakalab
0
140
機械学習 - ニューラルネットワーク入門
trycycle
PRO
0
910
コンピュータビジョンによるロボットの視覚と判断:宇宙空間での適応と課題
hf149
1
470
AI(人工知能)の過去・現在・未来 —AIは人間を超えるのか—
tagtag
0
130
Hakonwa-Quaternion
hiranabe
1
160
学術講演会中央大学学員会府中支部
tagtag
0
340
高校生就活へのDA導入の提案
shunyanoda
0
6.1k
Featured
See All Featured
Large-scale JavaScript Application Architecture
addyosmani
515
110k
Leo the Paperboy
mayatellez
0
1.3k
Practical Orchestrator
shlominoach
190
11k
Winning Ecommerce Organic Search in an AI Era - #searchnstuff2025
aleyda
0
1.8k
Leading Effective Engineering Teams in the AI Era
addyosmani
9
1.4k
The Language of Interfaces
destraynor
162
25k
Skip the Path - Find Your Career Trail
mkilby
0
27
A Soul's Torment
seathinner
1
2k
Responsive Adventures: Dirty Tricks From The Dark Corners of Front-End
smashingmag
254
22k
Ten Tips & Tricks for a 🌱 transition
stuffmc
0
35
Visual Storytelling: How to be a Superhuman Communicator
reverentgeek
2
400
Why Our Code Smells
bkeepers
PRO
340
57k
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