A complete overview of graph theory algorithms in computer science and mathematics
Updated on Sep, 2026
Programming, Software Engineering, Algorithms
Duration - 6.5 hours
Training 5 or more people ?
Get your team access to 10000+ top Tutorials Point courses anytime, anywhere.
This course provides a complete introduction to Graph Theory algorithms in computer science.
Topics covered in these videos include: how to store and represent graphs on a computer; common graph theory problems seen in the wild; famous graph traversal algorithms (DFS & BFS); Dijkstra's shortest path algorithm (both the lazy and eager version); what a topological sort is, how to find one, and places it's used; learning about detecting negative cycles and finding shortest paths with the Bellman-Ford and Floyd-Warshall algorithms; discovering bridges and articulation points in graphs; understanding and detecting strongly connected components with Tarjan's algorithm, and finally solving the travelling salesman problem with dynamic programming.
Check out the detailed breakdown of what’s inside the course
Use your certificate to make a career change or to advance in your current career.
Become a valued member of Tutorials Point and enjoy unlimited access to our vast library of top-rated Video Courses
Master prominent technologies at full length and become a valued certified professional.