# Minimum Number of Platforms Required for a Railway/Bus Station Method 1

# Job Sequencing Problem Find and Union

Given an array of jobs where every job has a deadline and associated profit if the job is finished before the deadline. It is also given that every job takes single unit of time, so the minimum possible deadline for any job is 1. How to maximize total profit if only one job can be… Read more

# Job Sequencing Problem

Given an array of jobs where every job has a deadline and associated profit if the job is finished before the deadline. It is also given that every job takes single unit of time, so the minimum possible deadline for any job is 1. How to maximize total profit if only one job can be… Read more

# Dijkstra’s shortest path algorithm

# Huffman Coding

# Prim’s Minimum Spanning Tree (MST)

# Kruskal’s Minimum Spanning Tree Algorithm

# Find cycle/loop in the graph – Find and Union with Path Compression

To identify loop in the graph, We are going to use Find and Union technic with Path Compression. We are going to create subject of each vertex and we will represent one element of that subset as a parent, So next time we will take two vertex will check the parent of each, if both… Read more

# Find cycle/loop in the graph – Find and Union

To identify loop in the graph, We are going to use Find and Union technic. We are going to create subject of each vertex and we will represent one element of that subset as a parent, So next time we will take two vertex will check the parent of each, if both has same parent… Read more