Upgrade to Pro
— share decks privately, control downloads, hide ads and more …
Speaker Deck
Sign up for free
Menu
Search
Features
All features
Private URLs
Password Protection
Custom URLS
Scheduled publishing
Remove Branding
Restrict embedding
Deck Collections
Notes
Features
All features
Private URLs
Password Protection
Custom URLS
Scheduled publishing
Remove Branding
Restrict embedding
Deck Collections
Notes
Explore
Featured decks
Featured speakers
Programming
Technology
Storyboards
Explore
Featured decks
Featured speakers
Programming
Technology
Storyboards
Pricing
Search
Sign in
Sign up for free
Floyd-Warshall
Search
Chen
November 17, 2022
Science
100
0
Share
Embed
Copy iframe code
Copy JS code
Copy link
Start on current slide
Floyd-Warshall
Chen
November 17, 2022
More Decks by Chen
See All by Chen
Example ROP in MIPS
tiffany_04192
0
68
defense
tiffany_04192
0
87
Dijkstra’s Algorithm
tiffany_04192
0
130
Topological sort DFS
tiffany_04192
0
100
BFS
tiffany_04192
0
140
DFS
tiffany_04192
0
130
Cache behavior
tiffany_04192
0
97
Cache miss paper
tiffany_04192
0
120
Greedy
tiffany_04192
0
110
Other Decks in Science
See All in Science
O(log n)-Approximation Algorithms for Bipartiteness Ratio
tasusu
0
210
Cross-Media Technologies, Information Science and Human-Information Interaction
signer
PRO
3
33k
AI for Phage-Host prediction
michielstock
0
130
データベース08: 実体関連モデルとは?
trycycle
PRO
0
1.6k
科学で迫る勝敗の法則-スポーツデータ分析の最前線 (刈谷市連携講座.2026年7月) / The principle of victory discovered by science. at Kariya City, 2027.07
konakalab
0
180
CVPR2026_VGGTとその仲間たち
mickey_0226
0
1.1k
機械学習 - 授業概要
trycycle
PRO
0
650
機械学習 - DBSCAN
trycycle
PRO
0
2.1k
人生を変えた一冊「独学大全」のはなし / Self-study ENCYCLOPEDIA: The Book Which Change My Life #独学大全 #EM推し本
expajp
0
210
Van Dare naar Durf
voginip
0
310
データベース11: 正規化(1/2) - 望ましくない関係スキーマ
trycycle
PRO
0
1.7k
J-STAGE全文XML登載必須化について
xspa2012
0
1.5k
Featured
See All Featured
JAMstack: Web Apps at Ludicrous Speed - All Things Open 2022
reverentgeek
1
610
Documentation Writing (for coders)
carmenintech
77
5.5k
実際に使うSQLの書き方 徹底解説 / pgcon21j-tutorial
soudai
PRO
203
76k
What’s in a name? Adding method to the madness
productmarketing
PRO
24
4.2k
Abbi's Birthday
coloredviolet
4
10k
RailsConf & Balkan Ruby 2019: The Past, Present, and Future of Rails at GitHub
eileencodes
141
35k
Evolving SEO for Evolving Search Engines
ryanjones
0
300
Stop Working from a Prison Cell
hatefulcrawdad
274
21k
Build your cross-platform service in a week with App Engine
jlugia
234
19k
Unsuck your backbone
ammeep
672
58k
How Software Deployment tools have changed in the past 20 years
geshan
1
34k
Building a A Zero-Code AI SEO Workflow
portentint
PRO
0
730
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