In this course, Triveni will discuss and compare various shortest path algorithms. understand where to apply them. There will be solved examples and practice problems as well. Basic knowledge of data-structures and graphs search is required.
ENGLISH
Intermediate
In this session, Triveni will introduce shortest path algorithms. And dive deeper into the Floyd-Warshall algorithm. Some practice problems will also be provided. And, at-least one complete solution will also be provided at the end.
Jan 15, 2021 • 2h 0m
Triveni Mahatha
ENGLISH
Intermediate
In this session, Triveni will discuss about Dijkstra's algorithm for finding shortest path. Knowledge of basic graph algorithms (such as BFS) and basic data structures (Segment Tree/ Fenwick Tree etc) are pre-requisites. Practice problems included.
Jan 16, 2021 • 2h 0m
Triveni Mahatha
ENGLISH
Intermediate
In this session, Triveni will discuss Bellman-Ford algorithm. Which works for negative edge weights as well. Why Dijkstra's doesn't work? How to check negative cycles? Compare shortest path algorithms. Practice problems and solved examples included.
Jan 17, 2021 • 2h 0m
Triveni Mahatha
Get subscription and access unlimited live and recorded courses from India's best educators
Chat with your educator, engage in discussions, ask your doubts, and answer polls - all while the class is going on
Evaluate your preparation with our regular mock tests and quizzes and get detailed analysis on your performance
All our courses are structured in line with your exam syllabus to help you best prepare for it