Greedy Algorithms | Set 6 (Prim’s MST for Adjacency List Representation)
Greedy Algorithms | Set 6 (Prim’s MST for Adjacency List Representation) - Minimum Spanning Tree - We have discussed Prim’s...
Browse Category
Greedy Algorithm
12 Articles
Minimum Number of Platforms Required for a Railway/Bus Station
Minimum No of Platforms Required for a Railway/Bus Station - Greedy algorithm - Given arrival and departure times of all...
K Centers Problem
K Centers Problem - Greedy Algorithm - Given n cities and distances between every pair of cities, select k cities to place...
Greedy Algorithm to find Minimum number of Coins
Greedy Algorithm to find Minimum number of Coins - Greedy Algorithm - Given a value V, if we want to make change for V Rs....
Job Sequencing Problem
Job Sequencing Problem - Greedy Algorithm - Given array of jobs where every job has deadline and associated profit if job is...
Dijkstra’s Algorithm for Adjacency List Representation
Dijkstra’s Algorithm for Adjacency List Representation - Greedy Algorithm - We have discussed Dijkstra’s algorithm and its...
Dijkstra’s shortest path algorithm
Dijkstra’s shortest path algorithm - Greedy algorithm - Dijkstra’s algorithm is very similar to Prim’s algorithm for minimum...
Prim’s MST for Adjacency List Representation
Prim’s MST for Adjacency List Representation - Greedy algorithm - We have discussed Prim’s algorithm and implementation for...
Prim’s Minimum Spanning Tree
Prim’s Minimum Spanning Tree - Greedy Algorithm - We have discussed Kruskal’s algorithm for Minimum Spanning Tree. Like...
Huffman Coding
Huffman Coding - Greedy Algorithm - Huffman coding is a lossless data compression algorithm. The idea is to assign...
