# Status Problem Level Completes Likes 1 Job Sequencing algorithm - Java Medium % 1 2 Kruskal's Algorithm – Minimum Spanning Tree (MST) - Complete Java Implementation Hard % 0 3 Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue without decrease key in O(ElogV) Hard % 0 4 Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue with decrease key Hard % 0 5 Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Min Heap Hard % 1 6 Prim’s - Minimum Spanning Tree (MST) |using Adjacency Matrix Hard % 0 7 Prim’s Algorithm - Minimum Spanning Tree (MST) Hard % 0 Job Sequencing algorithm - Java Kruskal's Algorithm – Minimum Spanning Tree (MST) - Complete Java Implementation Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue without decrease key in O(ElogV) Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue with decrease key Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Min Heap Prim’s - Minimum Spanning Tree (MST) |using Adjacency Matrix Prim’s Algorithm - Minimum Spanning Tree (MST) 1
