Jun 7, 2021 • 1h 12m
68K watch mins
In this class, Saptarshi shall introduce one of the prime shortest-path algorithms - the Floyd Warshall. This session has no prerequisites as such. The focus of this session shall be on developing the approach from scratch and ensuring that the heuristic adopted shall cover all possibilities of paths, thereby concluding it as a foolproof solution. For students who've studied it in some early stage, this session shall help to clear the many misconceptions that commonly prevail about the topic.
Ended on Mar 3, 2021
Starts on Sep 30, 2021 • 11 lessons
Starts on Oct 3, 2021 • 9 lessons