The Minimum Spanning Tree Problem: Difference between revisions

From NovaOrdis Knowledge Base
Jump to navigation Jump to search
Line 6: Line 6:
=The Problem=
=The Problem=


Given an [[Graph_Concepts#Undirected_Graph|undirected]] graph G=(V, E)
Given an [[Graph_Concepts#Undirected_Graph|undirected]] graph G=(V, E),

Revision as of 21:20, 20 October 2021

Internal

The Problem

Given an undirected graph G=(V, E),