Register for 45 Day Coding Challenge by CodeStudio and win some exciting prizes
×
Home Discussions Write at Opengenus IQ
×
  • About
  • Track your progress
  • Deep Learning Projects
  • Python Projects
  • Join our Internship 🎓
  • RANDOM
  • 100+ Graph Algorithms
  • 100+ DP Problems
  • 50+ Linked List Problems
  • 50+ Array Problems
  • One Liner
  • 50+ Binary Tree problems
  • Home
  • Rust Projects

Minimum Spanning Tree (MST)

Minimum Spanning Tree (MST) is a core concept in Graph Algorithms and is frequently, used in Graph Connectivity problems.

Algorithms

Minimum cost to connect all points (using MST)

In this article, we will understand how to solve the minimum cost to connect all the points problem using Minimum Spanning Tree.

Aswin Shailajan
Minimum Spanning Tree (MST)

Water distribution [solved using Minimum Spanning Tree]

In this article, we have solved the problem of Water distribution using Minimum Spanning Tree, Union Find and Sorting Algorithms.

Aswin Shailajan
Graph Algorithms

Boruvka Minimum Spanning Tree

Borůvka's algorithm is an algorithm for finding a minimum spanning tree in a graph for which all edge weights are distinct, or a minimum spanning forest in the case of a graph that is not connected.

Alexa Ryder Alexa Ryder
Graph Algorithms

Prim Minimum Spanning Tree Algorithm

Prim's algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. It finds a subset of the edges that forms a tree that includes every vertex,

Alexa Ryder Alexa Ryder
Graph Algorithms

Kruskal Minimum Spanning Tree Algorithm

Kruskal's algorithm is a minimum-spanning-tree algorithm which finds an edge of the least possible weight that connects any two trees in the forest. It is a greedy algorithm in graph theory as it finds a minimum spanning tree for a connected weighted graph adding increasing cost arcs at each step

Alexa Ryder Alexa Ryder
Graph Algorithms

What is a Minimum Spanning Tree?

A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted directed or undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight.

Alexa Ryder Alexa Ryder
OpenGenus IQ © 2023 All rights reserved â„¢ [email: team@opengenus.org]
Top Posts LinkedIn Twitter