Copyright	Copyright (C) 2021 Yoo Chung
License	GPL-3.0-or-later
Maintainer	dev@chungyc.org
Safe Haskell	Safe-Inferred
Language	GHC2021

Solutions.P84

Description

Some solutions to Problems.P84 of Ninety-Nine Haskell Problems.

Synopsis

minimumSpanningTree :: G -> Map Edge Int -> G

Documentation

minimumSpanningTree :: G -> Map Edge Int -> G Source #

Write a function which constructs the minimum spanning tree of a given weighted graph. While the weight of an edge could be encoded in the graph represention itself, here we will specify the weight of each edge in a separate map.