Bellman-Ford Algorithm Courses and Certifications

Algorithms on Graphs

2272 ratings at Coursera

Explore graph algorithms for optimal routes, network design, and social network analysis. Learn traversal techniques, shortest paths, and minimum spanning trees with real-world applications.

• Coursera
• 2 days 6 hours 37 minutes
• On-Demand
• Paid Course

Learn Data Structures and Algorithms 2 in Python

99 ratings at Boot.dev

Master advanced algorithms in Python, from Dijkstra's and A* Search to Dynamic Programming and Linear Programming. Enhance problem-solving skills and optimize code performance for complex computational challenges.

• Boot.dev
• 22 hours
• On-Demand
• Paid Course

Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

829 ratings at Coursera

Explore advanced graph algorithms, NP-completeness, and strategies for tackling computationally intractable problems. Learn Bellman-Ford, Floyd-Warshall, and heuristic approaches for complex algorithmic challenges.

• Coursera
• 13 hours 27 minutes
• On-Demand
• Paid Course

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

Graph Theory Algorithms for Competitive Programming

807 ratings at Udemy

Learn Graphs Algorithms in Computer Science & Mathematics, theory + hands-on coding and ace Competitive Coding problems!

• Udemy
• 23 hours 8 minutes
• On-Demand
• Paid Course

Packet Switching Networks and Algorithms

455 ratings at Coursera

Explore packet switching networks, routing algorithms, and traffic management techniques for efficient data transmission and network optimization.

• Coursera
• 17 hours 46 minutes
• On-Demand
• Paid Course

Graph Algorithms

Learn how to use algorithms to explore graphs, compute shortest distance, min spanning tree, and connected components.

• edX
• 6 weeks, 8-10 hours a week
• On-Demand
• Free Online Course (Audit)

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

Graph theory algorithms visualized

78 ratings at Udemy

Unleash the power of graph theory with cutting-edge algorithms

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

Program Structure and Algorithms Part 2

Master dynamic programming, network flow algorithms, computational complexity theory, Bayesian inference, and randomized algorithms for advanced problem-solving.

• Coursera
• 1 day 7 hours 42 minutes
• On-Demand
• Paid Course

GERAD Research Center

Knowledge Graph Reasoning with Graph Neural Networks

Explore knowledge graph reasoning using graph neural networks. Learn about Neural Bellman-Ford Networks and GNN Query Executor for single-hop and multi-hop queries, combining symbolic methods with neural approaches.

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

Paul G. Allen School

Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators

Explore parallel algorithms for approximating undirected shortest paths using low hop emulators. Learn about innovative techniques and their applications in graph theory.

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

Simons Institute

Size (OOD) Generalization of Neural Models via Algorithmic Alignment

Explore how neural models achieve size generalization through algorithmic alignment, covering theoretical foundations and practical applications in geometric optimization problems.

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