| Copyright | (c) Marcelo Garlet Milani 2026 |
|---|---|
| License | MIT |
| Maintainer | mgmilani@pm.me |
| Stability | stable |
| Safe Haskell | Safe-Inferred |
| Language | Haskell2010 |
Nauty.Digraph6
Contents
Description
This module contains functions for encoding and decoding graphs in digrap6 format.
If you want to work with a more general interface instead, use Nauty.
Synopsis
- data AdjacencyMatrix = AdjacencyMatrix {}
- arcExists :: AdjacencyMatrix -> Word64 -> Word64 -> Bool
- fromArcList :: Word64 -> [(Word64, Word64)] -> AdjacencyMatrix
- toArcList :: AdjacencyMatrix -> (Word64, [(Word64, Word64)])
- parse :: Text -> [Either Text AdjacencyMatrix]
- digraph :: Text -> Either Text AdjacencyMatrix
- encode :: AdjacencyMatrix -> Text
Graph structure
data AdjacencyMatrix Source #
A digraph represented as an adjacency matrix.
Constructors
| AdjacencyMatrix | |
Instances
| Show AdjacencyMatrix Source # | |
Defined in Nauty.Digraph6.Internal Methods showsPrec :: Int -> AdjacencyMatrix -> ShowS # show :: AdjacencyMatrix -> String # showList :: [AdjacencyMatrix] -> ShowS # | |
| Eq AdjacencyMatrix Source # | |
Defined in Nauty.Digraph6.Internal Methods (==) :: AdjacencyMatrix -> AdjacencyMatrix -> Bool # (/=) :: AdjacencyMatrix -> AdjacencyMatrix -> Bool # | |
Arguments
| :: AdjacencyMatrix | |
| -> Word64 | Tail |
| -> Word64 | Head |
| -> Bool |
Whether there is an arc from the first vertex to the second.
Arguments
| :: Word64 | Number of vertices |
| -> [(Word64, Word64)] | List of arcs |
| -> AdjacencyMatrix |
Create an adjacency matrix from a list of arcs.
Vertices need to be in the range from 0 to n - 1.
toArcList :: AdjacencyMatrix -> (Word64, [(Word64, Word64)]) Source #
The the number of vertices of a digraph together with a list of its arcs.
Parsing
parse :: Text -> [Either Text AdjacencyMatrix] Source #
Parse all digraphs in the input text. Digraphs are stored one per line.
Encoding
encode :: AdjacencyMatrix -> Text Source #
Encode a graph in digraph6 format.