Introduction Graph algorithms are always quite intimidating to start with but are pretty easy to comprehend if you get the hang of it. We will discuss here one such beautiful algorithm to find the Minimum Spanning tree of a given ...

Introduction To Greedy Algorithms A greedy algorithm is an algorithmic paradigm that builds up a solution piece by piece, always choosing the next piece that offers the most immediate benefit. This means that the choices made are only locally optimal, ...