Qualified ICPC 2016 World Final. Won multiple Codechef Long Challenges (India). ICPC Onsite Regionals' Problem setter and Judge. IIT Kanpur.

Competitive Programming

Triveni Mahatha

Plus Group for course 4HEOQP8V

English

In this session, Triveni will discuss the Prim's algorithm to solve the MST problem. Comparison between the Prim's and the Kruskal's algorithm will be drawn as well. Live coding will be used to enhance the learning experience of the learner. Basic understanding of Graphs and Trees is preferable.

Minimum Spanning Tree and Disjoint Set Union - III

Minimum Spanning Tree and Disjoint Set Union - III

Triveni Mahatha

Ended on Feb 17

0 practices