The Minimum Spanning Tree Problem

From NovaOrdis Knowledge Base
Revision as of 20:07, 22 October 2021 by Ovidiu (talk | contribs) (→‎Internal)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

External

Internal

Overview

We discuss the minimum spanning problem in the context of undirected graphs. The same problem can be discussed for directed graphs but in that case it is referred to as the Optimal Branching Problem.

The Problem

Given an undirected graph G=(V, E) and a positive or negative cost ce for each edge e ∈ E, find the minimum cost spanning tree T ⊆ E (MST).

Algorithms

The minimum spanning tree problem is solved by greedy algorithms:

Prim's Algorithm

Prim's Algorithm

Kruskal's Algorithm

Kruskal's Algorithm