A. Prerequisites

Getting Started with Competitive Programming

(an NPTEL course)

Module A. Prerequisites

If you would like to discover a generic approach to spanning tree algorithms and go through the proofs of correctness of these algorithms, you might want to read this chapter.
Video Reference - Introduction
Video Reference - Prim's Algorithm
Video Reference - Kruskal's Algorithm

super-embed:<div id="hyvor-talk-view"></div><script async defer type="text/javascript" src="//talk.hyvor.com/web-api/embed.js"></script>