99 Elm Problems/Problem 84

From Wikibooks, open books for an open world
Jump to navigation Jump to search

Find the minimal spanning tree of a graph. / Hint: Use the algorithm of Prim. A small modification of the solution of problem does the trick.

# # # THIS IS A STUB # # #

Example in Elm:
import Html exposing (text)
import List

f : Int -> Int
-- your implementation goes here

main = text (toString (f 0))