This Bootcamp is a comprehensive guide to mastering graph algorithms. Topics include breadth-first search, depth-first search, Dijkstra's algorithm, A* algorithm, Bellman-Ford algorithm, and Floyd-Warshall algorithm, and much more.  It also covers topics such as how to find the shortest path between two nodes in a graph, how to find the shortest path between two nodes in a weighted graph, and how to find the shortest path between two nodes in a directed graph.

Topics Included

• Basic Terminologies
• BFS, DFS
• Cycle Detection
• DAG
• Minimum Spanning Tree(MST)
• Shortest Path Algorithms
• Hamiltonian Path and Hamiltonian Cycle

Duration

The first batch is starting from 12th Dec 2021 (15 days cohort)

Deliverables

• A final exam (on hackerrank), anyone scoring more than 30% marks in the exam will be provided a verified certificate with the authenticity of Edualgo Academy and will be given a chance to take part in the ongoing research on graph algorithms.
• A short textbook on Graph Algorithms
• LIVE video lectures daily(Evening time preferred in IST)
• Live doubt solving