Welcome To Tutorialspoint.dev
Officially launched 18th May 2019

# Efficient Huffman Coding for Sorted Input Greedy Algo-4

We recommend to read following post as a prerequisite for this. Greedy Algorithms | Set 3 (Huffman Coding) Time complexity of the algorithm discussed in above post is...

# Kruskal’s Minimum Spanning Tree Algorithm Greedy Algo-2

What is Minimum Spanning Tree? Given a connected and undirected graph, a spanning tree of that graph is a subgraph that is a tree and connects all the vertices togeth...

# Activity Selection Problem Greedy Algo-1

Greedy is an algorithmic paradigm that builds up a solution piece by piece, always choosing the next piece that offers the most obvious and immediate benefit. Greedy...

...

# Prim’s Minimum Spanning Tree (MST) Greedy Algo-5

We have discussed&#xA0;Kruskal&#x2019;s algorithm for Minimum Spanning Tree. Like Kruskal&#x2019;s algorithm, Prim&#x2019;s algorithm is also a&#xA0;Greedy algorithm...

# Dijkstra’s shortest path algorithm Greedy Algo-7

Given a graph and a source vertex in the graph, find shortest paths from source to all vertices in the given graph. Dijkstra&#x2019;s algorithm is very similar to Pr...

# Graph Coloring Set 2 (Greedy Algorithm)

We introduced graph coloring and applications in previous post. As discussed in the previous post, graph coloring is widely used. Unfortunately, there is no efficient...

# Prim’s MST for Adjacency List Representation Greedy Algo-6

We recommend to read following two posts as a prerequisite of this post. 1. Greedy Algorithms | Set 5 (Prim&#x2019;s Minimum Spanning Tree (MST)) 2. Graph and its rep...

# Dijkstra’s Algorithm for Adjacency List Representation Greedy Algo-8

We recommend to read following two posts as a prerequisite of this post. 1. Greedy Algorithms | Set 7 (Dijkstra&#x2019;s shortest path algorithm) 2.&#xA0;Graph and it...

# Greedy Algorithms

12 Greedy Algorithms Please wait while the activity loads. If this activity does not load, t...