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

Solutions.P85

Description

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

Synopsis

isomorphic :: G -> G -> Bool
isomorphic' :: G -> G -> Bool
isomorphic'' :: G -> G -> Bool

Documentation

isomorphic :: G -> G -> Bool Source #

Determine whether two graphs are isomorphic.

Builds up a bijection from a starting vertex to its neighbors, expanding until it encounters an inconsistency or until there are no more vertexes to expand to.

isomorphic' :: G -> G -> Bool Source #

Determine whether two graphs are isomorphic.

This tests all bijections of vertexes from one graph to another to see if any are identical.

isomorphic'' :: G -> G -> Bool Source #

Determine whether two graphs are isomorphic.

Tests bijections which are limited to matching vertexes with the same degree, and looks for any which results in one graph becoming identical to the other.