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
91
Floyd-Warshall
Chen
November 17, 2022
Tweet
Share
More Decks by Chen
See All by Chen
Example ROP in MIPS
tiffany_04192
0
61
defense
tiffany_04192
0
74
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
白金鉱業Meetup_Vol.20 効果検証ことはじめ / Introduction to Impact Evaluation
brainpadpr
2
1.7k
Performance Evaluation and Ranking of Drivers in Multiple Motorsports Using Massey’s Method
konakalab
0
160
HajimetenoLT vol.17
hashimoto_kei
1
190
NDCG is NOT All I Need
statditto
2
2.9k
MCMCのR-hatは分散分析である
moricup
0
610
【RSJ2025】PAMIQ Core: リアルタイム継続学習のための⾮同期推論・学習フレームワーク
gesonanko
0
670
2025-05-31-pycon_italia
sofievl
0
150
LayerXにおける業務の完全自動運転化に向けたAI技術活用事例 / layerx-ai-jsai2025
shimacos
7
22k
My Little Monster
juzishuu
0
610
中央大学AI・データサイエンスセンター 2025年第6回イブニングセミナー 『知能とはなにか ヒトとAIのあいだ』
tagtag
PRO
0
130
データマイニング - コミュニティ発見
trycycle
PRO
0
220
知能とはなにかーヒトとAIのあいだー
tagtag
PRO
0
180
Featured
See All Featured
The Cult of Friendly URLs
andyhume
79
6.8k
<Decoding/> the Language of Devs - We Love SEO 2024
nikkihalliwell
1
150
Lightning Talk: Beautiful Slides for Beginners
inesmontani
PRO
1
460
Everyday Curiosity
cassininazir
0
150
Speed Design
sergeychernyshev
33
1.6k
JavaScript: Past, Present, and Future - NDC Porto 2020
reverentgeek
52
5.9k
Music & Morning Musume
bryan
47
7.1k
Why You Should Never Use an ORM
jnunemaker
PRO
61
9.8k
"I'm Feeling Lucky" - Building Great Search Experiences for Today's Users (#IAC19)
danielanewman
231
22k
Dealing with People You Can't Stand - Big Design 2015
cassininazir
367
27k
Skip the Path - Find Your Career Trail
mkilby
1
71
Crafting Experiences
bethany
1
74
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