Skip to content
Today's problem
Algorithms
Algorithms
Roadmap
Problems
Articles
CS
Algorithms
/
Graph Theory
Networks
Intermediate
Graph Theory
Traverse complex networks using BFS, DFS, and Dijkstra's shortest path algorithms.
4
Algorithms
✓
Custom inputs
Algorithms in this module
01
Graph BFS
O(V + E)
time
·
O(V)
space
▶ Visualize
02
Graph DFS
O(V + E)
time
·
O(V)
space
▶ Visualize
03
Dijkstra
O((V + E) log V)
time
·
O(V)
space
▶ Visualize
04
Bellman-Ford
O(V × E)
time
·
O(V)
space
▶ Visualize
Every Graph Theory page
Graph Theory
BFS
DFS
Dijkstra
Bellman-Ford