Getting Started with Competitive Programming
(an NPTEL course)
Home ⸱ Quick Links ⸱ Grading Policy ⸱ References ⸱ FAQ ⸱ Feedback ⸱ Connect ⸱ Credits
Module 3. All Paris Shortest Paths
In this module, we focus on APSP in the absence of negative edge weights. We discuss an implementation of the Floyd-Warshall algorithm in the context of the Page Hopping problem on UVa, which you can find here.
The source code shown in the second video can be found here:
super-embed:<div id="hyvor-talk-view"></div><script async defer type="text/javascript" src="//talk.hyvor.com/web-api/embed.js"></script>