# Status Problem video Level Completes Likes 559 Minimizing Taxis for Maximum Efficiency Hard % 1 477 Job Sequencing algorithm Medium % 1 287 Kruskal's Algorithm – Minimum Spanning Tree (MST) - Complete Implementation Hard % 0 285 Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue without decrease key in O(ElogV) Hard % 0 284 Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue with decrease key Hard % 0 283 Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Min Heap Hard % 1 282 Prim’s - Minimum Spanning Tree (MST) |using Adjacency Matrix Hard % 0 281 Prim’s Algorithm - Minimum Spanning Tree (MST) Hard % 0 Minimizing Taxis for Maximum Efficiency Job Sequencing algorithm Kruskal's Algorithm – Minimum Spanning Tree (MST) - Complete 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
