```{- |
Description: Graph isomorphism
Maintainer: dev@chungyc.org

Part of Ninety-Nine Haskell "Problems".  Some solutions are in "Solutions.P85".
-}
module Problems.P85 (isomorphic, graph85, graph85') where

import           Problems.Graphs
import           Problems.P80
import qualified Solutions.P85   as Solution

-- \$setup
-- >>> import           Problems.Graphs
-- >>> import           Problems.P80

-- | Two graphs \(G_1 = (V_1,E_1)\) and \(G_2 = (V_2,E_2)\) are isomorphic if there is
-- a bijection \(f: V_1 -> V_2\) such that for any vertexes \(x\), \(y\) in \(V_1\),
-- \(x\) and \(y\) are adjacent if and only if \(f(x)\) and \(f(y)\) are adjacent.
--
-- Write a function that determines whether two graphs are isomorphic.
--
-- === Examples
--
-- >>> isomorphic (toG \$ Paths [[1,2,3], [2,4]]) (toG \$ Paths [[1,2,3],[1,4]])
-- False
--
-- >>> isomorphic graph85 graph85'
-- True
isomorphic :: G -> G -> Bool
isomorphic :: G -> G -> Bool
isomorphic = G -> G -> Bool
Solution.isomorphic

-- | Example graph to try out 'isomorphic', along with 'graph85''.
graph85 :: G
graph85 :: G
graph85 = forall g. ConvertibleGraph g => g -> G
toG forall a b. (a -> b) -> a -> b
\$ [[Vertex]] -> Paths
Paths [[Vertex
1,Vertex
5,Vertex
3,Vertex
7,Vertex
1,Vertex
6,Vertex
2,Vertex
5], [Vertex
2,Vertex
8,Vertex
3], [Vertex
6,Vertex
4,Vertex
8], [Vertex
4,Vertex
7]]

-- | Example graph to try out 'isomorphic', along with 'graph85'.
graph85' :: G
graph85' :: G
graph85' = forall g. ConvertibleGraph g => g -> G
toG forall a b. (a -> b) -> a -> b
\$ [[Vertex]] -> Paths
Paths [[Vertex
1,Vertex
2,Vertex
3,Vertex
4,Vertex
8,Vertex
5,Vertex
1], [Vertex
5,Vertex
6,Vertex
7,Vertex
8], [Vertex
2,Vertex
6], [Vertex
3,Vertex
7], [Vertex
1,Vertex
4]]
```