GeezerVison

The World Wide Web, restored to 800 pixels of glory.

GeezerVison is showing rulcode.com — Prim's Algorithm Visualizer & Solution | Rulcode

Fetching algorithms...

Prim's Algorithm Visualizer & Solution | Rulcode

Loading problem details...

26. Prim's Algorithm

PRO

Hard

Topics

Companies

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

Input: points = [[0,0],[2,2],[3,10],[5,2],[7,0]]

Output: 20

Explanation: The minimum cost to connect all points is 20.

Example 2:

Input: points = [[3,12],[-2,5],[-4,1]]

Output: 18

Explanation: The minimum cost to connect all points is 18.

Constraints:

Time Complexity

O(E log V)

Space Complexity

O(V)

You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.