Excalidraw Data
Text Elements
g
k
p
n
d
b
a
h
l
i
e
j
m
o
f
c
g
k
p
n
d
b
a
h
l
i
e
j
m
o
f
c
6
3
1
Breadth-First Search (BFS)
g
k
p
n
d
b
a
h
l
i
e
j
m
o
f
c
1
3
6
Dijkstra’s Algorithm
a→b→d→…→p = 6 steps a→c→f→…→p = 6 steps
g
k
p
n
d
b
a
h
l
i
e
j
m
o
f
c
g
k
p
n
d
b
a
h
l
i
e
j
m
o
f
c
6
3
1
Breadth-First Search (BFS)
g
k
p
n
d
b
a
h
l
i
e
j
m
o
f
c
1
3
6
Dijkstra’s Algorithm
a→b→d→…→p = 6 steps a→c→f→…→p = 6 steps