C and DS Lab

• Implement link list (basic operation)  Code
• Implement stack using link list.  Code
• Implement queue using link list.  Code
• Find perfect matching using Gale-Shapley algorithm Code
• Given a graph using adjacency list representation, find the number of components in the graph. Code 
• Implement priority queue using heap data structure. Please note the heap should be implemented using linked list. Code
• Using the priority queue implement Dijkstra's Single source shortest path in a weighted graph. Code
• Write a program to find maximum independent set in the given chain graph G Code
• Write a program to find maximum independent set in the given tree T. Code 
• Write a program which finds the min cut of Directed Flow Network. Code