Greedy Algorithms | Set 6 (Prim’s MST for Adjacency List Representation) - Minimum Spanning Tree - We have discussed Prim’s algorithm and its implement.

# Category - Greedy Algorithm

Minimum No of Platforms Required for a Railway/Bus Station - Greedy algorithm - Given arrival and departure times of all trains that reach a railway station ...

K Centers Problem - Greedy Algorithm - Given n cities and distances between every pair of cities, select k cities to place warehouses ( ATM or Cloud...

Greedy Algorithm to find Minimum number of Coins - Greedy Algorithm - Given a value V, if we want to make change for V Rs. and we have infinite supply of each...

Job Sequencing Problem - Greedy Algorithm - Given array of jobs where every job has deadline and associated profit if job is finished before the deadline.

Dijkstra’s Algorithm for Adjacency List Representation - Greedy Algorithm - We have discussed Dijkstra’s algorithm and its implementation for adjacency.In this...

Dijkstra’s shortest path algorithm - Greedy algorithm - Dijkstra’s algorithm is very similar to Prim’s algorithm for minimum spanning tree. Like Prim’s MST, we...

Prim’s MST for Adjacency List Representation - Greedy algorithm - We have discussed Prim’s algorithm and implementation for adjacency matrix representation...

Prim’s Minimum Spanning Tree - Greedy Algorithm - We have discussed Kruskal’s algorithm for Minimum Spanning Tree. Like Kruskal’s algorithm, Prim’s algorithm...

Huffman Coding - Greedy Algorithm - Huffman coding is a lossless data compression algorithm. The idea is to assign variable-legth codes to input characters.