Computer scienceProgramming languagesJavaInterview preparationAlgorithms and problem solving techniques

Minimum spanning tree problem - Prim and Kruskal algorithms

Prim's algorithm case

Report a typo

When is it better to use Prim's algorithm?

Select one option from the list

Your priority is to use less memory

A graph has a lot of nodes that are connected only to one another node

A graph where every pair of nodes is connected to each other

___

Create a free account to access the full topic