Copyright | (c) Chris Reade 2021 |
---|---|
License | BSD-style |
Maintainer | chrisreade@mac.com |
Stability | experimental |
Safe Haskell | None |
Language | GHC2021 |
Tgraph.Decompose
Contents
Description
This module defines decompose and decompositions for Tgraphs, but also exposes two auxiliary functions for debugging and experimenting.
Documentation
decompositions :: Tgraph -> [Tgraph] Source #
infinite list of decompositions of a Tgraph
Exported auxiliary functions
phiVMap :: Tgraph -> Map Dedge Vertex Source #
phiVMap g produces a finite map from the phi edges (the long edges including kite joins) to assigned new vertices not in g. Both (a,b) and (b,a) get the same new vertex number. This is used(in decompFace and decompose. (Sort is used to fix order of assigned numbers). (Exported for use in TrackedTgraphs in Tgraphs module).