Minimum spanning tree by Prim algorithm online on Intellect

Used 527 times

Minimum spanning tree (Prim algorithm) online calculator

Prim algorithm takes a square matrix representing a graph with weighted edges and finds the edges that form the minimum spanning tree.

You can enter values again and recalculate the solution. Symmetric values are filled automatically, but you can change them manually if needed. The calculation always starts from the first row. Used edges are highlighted in red. If the graph is disconnected, a minimum spanning tree will not be found.

Description

Enter the matrix size.
Fill in the weight matrix for your graph.
Click "Run Prim".
Check the highlighted edges of the minimum spanning tree and the total weight.

Example calculation and graph-to-matrix conversion:

In computer science, Prim algorithm, also known as Jarnik algorithm, is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. It selects a subset of edges forming a tree that includes all vertices and has the minimum total edge weight.

Was this answer useful?

Choose a quick rating so we can improve the next answer for you.

How satisfied are you?

Your answer option for this service or noticed an error:

Prim algorithm is a greedy algorithm for finding a minimum spanning tree in a weighted undirected graph. It builds the tree step by step: starting from one vertex and adding the cheapest edge that connects the current tree to a new vertex.

Algorithms Programming