sln_2017_12
Copyright(c) Eric Mertens 2017
LicenseISC
Maintaineremertens@gmail.com
Safe HaskellNone
LanguageHaskell2010

Main

Description

https://adventofcode.com/2017/day/12

Day 12 asks us questions about connected components of a graph. For fun we'll just use the fgl package to do this.

Synopsis

Documentation

main :: IO () Source #

toGraph :: [(Int, [Int])] -> UGr Source #

Convert a list of nodes and the node's neighbors into an unlabeled graph.