Skip to main content
CourseintermediateFree

Routing Algorithms

Coursera

UC San Diego and HSE course on graph algorithms: graph representation, exploration and connectivity, topological sort, strongly connected components, shortest paths with BFS, Dijkstra, and Bellman-Ford, and minimum spanning trees. Learners implement each algorithm in programming assignments.

Visit resource
Also charted under:Network Flows

More resources on Routing Algorithms

See all Routing Algorithms resources →