• No products in the cart.


Course Curriculum

Course Curriculum

Module 01: Promo
Promo 00:03:00
Module 02 : Introduction
Introduction 00:14:00
Module 03 : Common Problem
Common Problem 00:10:00
Module 04 : Depth First Search
Depth First Search 00:11:00
Module 05 : Breadth First Search
Breadth First Search 00:08:00
Module 06 : Breadth First Search Shortest Path on a Grid
Breadth First Search Shortest Path on a Grid 00:17:00
Module 07 : Trees
Storage and Representation of Trees 00:10:00
Beginner Tree Algorithms 00:10:00
Rooting Tree 00:05:00
Center(s) of a Tree 00:06:00
Isomorphisms in Trees 00:11:00
Isomorphisms in Trees Source Code 00:10:00
Lowest Common Ancestor 00:17:00
Module 08 : Topological Sort
Topological Sort 00:14:00
Shortest and Longest Paths on DAGs 00:10:00
Khan’s Algorithm 00:14:00
Module 09 : Dijkstra
Dijkstra’s Shortest Path Algorithm 00:25:00
Dijkstra’s Shortest Path Algorithm Source Code 00:09:00
Module 10 : Bellman-Ford Algorithm
Bellman-Ford Algorithm 00:15:00
Module 11 : Floyd-Warshall Algorithm
Floyd-Warshall Algorithm 00:16:00
Floyd-Warshall Algorithm Source Code 00:10:00
Module 12 : Bridge and Algorithm Points
Algorithm to Find Bridges and Articulation Points 00:20:00
Algorithm to Find Bridges and Articulation Points Source Code 00:10:00
Module 13 : Tarjan Algorithm
Tarjan’s Algorithm for Finding Strongly Connected Components 00:17:00
Tarjan’s Algorithm for Finding Strongly Connected Components Source Code 00:07:00
Module 14 : Travelling Salesman Problem (TSP)
Travelling Salesman Problem (TSP) with Dynamic Programming 00:21:00
Travelling Salesman Problem (TSP) with Dynamic Programming Source Code 00:14:00
Module 15 : Eulerian Paths and Circuits
Existence of Eulerian Paths and Circuit 00:10:00
Finding Eulerian Paths and Circuits 00:16:00
Eulerian Paths Source Code 00:08:00
Module 16 : Prim’s Minimum Spanning Tree Algorithm
Prim’s Minimum Spanning Tree Algorithm (Lazy Version) 00:15:00
Prim’s Minimum Spanning Tree Algorithm ( Eager Version) 00:15:00
Prim’s Minimum Spanning Tree Algorithm Source Code ( Eager Version) 00:09:00
Module 17 : Network Flow
Max Flow Ford-Fulkerson Method 00:13:00
Max Flow Ford-Fulkerson Method Source Code 00:18:00
Network Flow: Unweighted Bipartite Graph Matching 00:11:00
Network Flow: Mice and Owls 00:08:00
Network Flow: Elementary Math 00:11:00
Network Flow: Edmond-Karp Algorithm 00:06:00
Network Flow: Edmond-Karp Algorithm Source Code 00:10:00
Network Flow: Capacity Scaling 00:10:00
Network Flow: Capacity Scaling Source Code 00:07:00
Network Flow: Dinic’s Algorithm 00:13:00
Network Flow: Dinic’s Algorithm Source Code 00:09:00

Graph Theory Algorithms - Basics

4.6( 7 REVIEWS )
Graph Theory Algorithms - Basics
  • Course Highlights

Gain the skills and credentials to kickstart a successful career and learn from the experts with this step-by-step training course. This Graph Theory Algorithms – Basics has been specially designed to help learners gain a good command of Graph Theory Algorithms – Basics, providing them with a solid foundation of knowledge to become a qualified professional.

Through this Graph Theory Algorithms – Basics, you will gain both practical and theoretical understanding of Graph Theory Algorithms – Basics that will increase your employability in this field, help you stand out from the competition and boost your earning potential in no time.

Not only that, but this training includes up-to-date knowledge and techniques that will ensure you have the most in-demand skills to rise to the top of the industry. This qualification is fully accredited, broken down into several manageable modules, ideal for aspiring professionals. 

  • Learning outcome
  • Get a deep understanding of the Graph Theory Algorithms - Basics just in hours not years
  • Familiar yourself with the recent development and updates of the relevant industry
  • Know how to use your theoretical and practical knowledge to adapt in any working environment
  • Get help from our expert tutors anytime you need
  • Access to course contents that are designed and prepared by industry professionals
  • Study at your convenient time and from wherever you want
  • Requirements
  • No formal qualifications required, anyone from any academic background can take this course.
  • Access to any internet-enabled smart device.
  • Why should I take this course?
  • 8+ hours of on-demand video lectures and downloadable resources.
  • Affordable premium-quality E-learning content, you can learn at your own pace.
  • You will receive a completion certificate upon completing the course.
  • Internationally recognized Accredited Qualification will boost up your resume.
  • You will learn the researched and proven approach adopted by successful salespeople to transform their careers.
  • You will be able to incorporate various practical sales techniques successfully and understand your customers better.


Hear what our happy students want to say

Setup Menus in Admin Panel