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

Solutions.P92

Description

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

Synopsis

gracefulTree :: G -> Maybe (Map Vertex Int)
gracefulTree' :: G -> Maybe (Map Vertex Int)

Documentation

gracefulTree :: G -> Maybe (Map Vertex Int) Source #

Gracefully label a tree graph.

This implementation builds up a partial graceful labeling, adding one vertex at a time. It gives up and tries another if a partial labeling cannot be extended.

gracefulTree' :: G -> Maybe (Map Vertex Int) Source #

Gracefully label a tree graph.

This implementation tries all permutations of vertex labels and checks if any are a graceful labeling.