$30 off During Our Annual Pro Sale. View Details »

Floyd-Warshall

Chen
November 17, 2022
Science
0
60

 Floyd-Warshall

Chen

November 17, 2022
Tweet

More Decks by Chen

See All by Chen
Example ROP in MIPS
tiffany_04192
0
12
defense
tiffany_04192
0
59
Dijkstra’s Algorithm
tiffany_04192
0
80
Topological sort DFS
tiffany_04192
0
65
BFS
tiffany_04192
0
67
DFS
tiffany_04192
0
76
Cache behavior
tiffany_04192
0
60
Cache miss paper
tiffany_04192
0
79
Greedy
tiffany_04192
0
73

Other Decks in Science

See All in Science
Hardness Self-Amplification: Simplified, Optimized, and Unified
nobushimi
0
130
Presenting Effectively with Data (in a Hurry)
thomaselove
1
200
SSII2023 [OS2] WovenCityに向けたVision AIプラットフォームの開発
ssii
PRO
1
360
Design of three-dimensional binary manipulators based on the KS statistic and maximum empty circles (IECON2023)
konakalab
0
120
Xpenologyなるアングラプロジェクト周りについて語るやつ
sushi514
0
330
Leveraging conformal prediction for calibrated probabilistic time series forecasts to accelerate the renewable energy transition
ingevandenende
1
120
Metric Recovery from Unweighted k-NN Graphs
joisino
1
420
FIBA W杯の日本代表って組み合わせ次第で2次ラウンド行けたんじゃね？をデータで検証
saltcooky12
0
160
Onsager代数とその周辺 / Onsager algebra tsudoi
usamik26
0
300
勉強会資料 / “Asymptotic Statistics” Section 2.1
asymptotic_minato
0
110
SHAPで因果関係を説明できる？
s1ok69oo
6
3.5k
Yasuke
drawsbygba
0
600

Featured

See All Featured
Docker and Python
trallard
32
2.4k
Thoughts on Productivity
jonyablonski
55
3.5k
Raft: Consensus for Rubyists
vanstee
130
6k
Web development in the modern age
philhawksworth
201
9.9k
Building Flexible Design Systems
yeseniaperezcruz
317
36k
What's new in Ruby 2.0
geeforr
335
30k
Testing 201, or: Great Expectations
jmmastey
26
6.1k
KATA
mclloyd
13
11k
10 Git Anti Patterns You Should be Aware of
lemiorhan
645
57k
Build The Right Thing And Hit Your Dates
maggiecrowley
23
1.7k
Mobile First: as difficult as doing things right
swwweet
214
8.3k
Writing Fast Ruby
sferik
615
59k

Transcript

  1. Floyd-Warshall: Dynamic Programming
    Floyd-Warshall computes all pairs, but let us focus on 5 to 6.
    62 / 71

    View Slide

  2. Floyd-Warshall: Dynamic Programming
    We start by considering only start(5) and dest(6) when k is 0.
    63 / 71

    View Slide

  3. Floyd-Warshall: Dynamic Programming
    Then we also consider node 1 when k is 1.
    64 / 71

    View Slide

  4. Floyd-Warshall: Dynamic Programming
    And node 2 when k is 2.
    65 / 71

    View Slide

  5. Floyd-Warshall: Dynamic Programming
    And node 3 when k is 3.....
    66 / 71

    View Slide

  6. 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

    View Slide

  7. Floyd-Warshall: Dynamic Programming
    Hmm it looks like some of those recursive calls will recompute
    the same thing...
    68 / 71

    View Slide