$
cd home
Graphs
(1)
Graph algorithms and traversals
$
ls graphs/
|
wc -l
1 templates found
template_dijkstra.cpp
O((V + E) log V)
Dijkstra's Algorithm
[Graphs]
Shortest path from single source (non-negative weights)
#shortest-path
#graph
#dijkstra
$
cat dijkstra
CON: CLOSED
CP-Base
categories
templates
$
⌘K
online