Shortest Path Algorithms Courses and Certifications

Graph Theory Algorithms

2075 ratings at Udemy

A complete overview of graph theory algorithms in computer science and mathematics.

• Udemy
• 9 hours 3 minutes
• On-Demand
• Paid Course

Unordered Data Structures

557 ratings at Coursera

Explore hash tables, disjoint sets, and graphs. Learn data structures and algorithms for unordered data, including graph traversal and shortest path finding.

• Coursera
• 20 hours 31 minutes
• On-Demand
• Paid Course

Trees and Graphs: Basics

187 ratings at Coursera

Basic algorithms on tree data structures, binary search trees, self-balancing trees, graph data structures and basic traversal algorithms on graphs. This course also covers advanced topics such as kd-trees for spatial data and algorithms for spatial data.

• Coursera
• 1 day 10 hours 5 minutes
• On-Demand
• Paid Course

Mastering critical SKILLS in Algorithms using C++: Part 2

281 ratings at Udemy

70 Challenges to master recursive based techniques, shortest-path and MST algorithms.

• Udemy
• 15 hours 4 minutes
• On-Demand
• Paid Course

Amazing Graph Algorithms : Coding in Java,JavaScript, Python

58 ratings at Udemy

Graph Data Structure, DFS, BFS, Minimum Spanning Tree, Shortest Path, Network Flow, Strongly Connected Components

• Udemy
• 9 hours
• On-Demand
• Paid Course

Coursera

Determine Shortest Paths Between Routers Using Python

19 ratings at Coursera

Implement adjacency list data structure to find shortest paths between routers, enhancing network routing efficiency and optimizing packet delivery in computer networks.

• Coursera
• 2 hours 5 minutes
• On-Demand
• Paid Course

Modern Graph Theory Algorithms with Python

14 ratings at Udemy

Master NetworkX, Social Network Analysis & Shortest Path Algorithms - Build 4 Professional Projects with Graph Theory

• Udemy
• 2 hours 22 minutes
• On-Demand
• Paid Course

CodeHelp - by Babbar

Graph Data Structures and Algorithms - Complete Course

Master graph algorithms from basics to advanced topics including BFS, DFS, shortest paths, MST, and strongly connected components with hands-on C++ implementation.

• YouTube
• 7 hours 10 minutes
• On-Demand
• Free Video

Understanding AI from Scratch - Neural Networks Course

Build neural networks from scratch, teaching a virtual car to drive. Learn AI fundamentals through hands-on coding and practical applications in this comprehensive tutorial.

• freeCodeCamp
• 3 hours 44 minutes
• On-Demand
• Free Video

DSA Crash Course: Graphs Deep Dive

Master graph algorithms and traversal techniques through hands-on practice with core problems like path finding, connected components, and island counting. Learn essential patterns for tackling complex graph structures.

• Taro
• 2 hours 7 minutes
• On-Demand
• Paid Course

Connectivity and Trees - Lecture 13

Explore graph connectivity and tree structures through optimization problems like finding shortest and fastest routes in this MIT mathematics lecture.

• YouTube
• 1 hour 22 minutes
• On-Demand
• Free Video

IEEE

Dynamic Approximate Shortest Paths and Beyond - Subquadratic and Worst Case Update Time

Explore cutting-edge algorithms for dynamic approximate shortest paths, focusing on subquadratic and worst-case update time complexities in graph theory and network optimization.

• YouTube
• 20 minutes
• On-Demand
• Free Video

IEEE

Parametric Shortest Paths in Planar Graphs

Explore efficient algorithms for computing shortest paths in planar graphs with varying edge weights, enhancing understanding of graph theory and optimization techniques.

• YouTube
• 21 minutes
• On-Demand
• Free Video

Simons Institute

Sublinear Algorithms in Social Networks via Core-Periphery Decomposition

Explore sublinear algorithms for large networks using core-periphery structure and degree distribution. Learn about accelerating tasks like node sampling and shortest path computations.

• YouTube
• 40 minutes
• On-Demand
• Free Video

Simons Institute

Graphs with Large Edge Weights for Shortest Path Structure - Sublinear Graph Simplification

Explore the relationship between graph shortest paths and edge weight ratios, examining reweighting techniques to preserve path structures.

• YouTube
• 32 minutes
• On-Demand
• Free Video