Music.Theory.Graph.Planar

https://users.cecs.anu.edu.au/~bdm/plantri/plantri-guide.txt

Documentation

plc_header_txt :: String

The 15-character header text indicating a Planar-Code file.

plc_header :: ByteString -> String

Read Plc header

plc_data :: ByteString -> [Int]

Read Plc data as list of Int

plc_length :: (Int, Int) -> Int

Calculate length of Plc data given (n-vertices,n-edges).

plc_scanner :: Int -> [Int] -> ([Int], [Int])

Scan Plc data and segment after k zeros.

type Plc = (Int, [[Int]])

(n-vertices,clockwise-edge-sequences)

plc_n_vertices :: Plc -> Int

plc_group :: Int -> [Int] -> Plc

Group Plc data into Plc structure.

plc_segment :: [Int] -> [Plc]

Segment input data into sequence of Plc.

plc_parse :: ByteString -> [Plc]

plc_load :: FilePath -> IO [Plc]

Load sequence of Plc from binary Planar-Code file.

plc_edge_set :: Plc -> [(Int, Int)]

All edges (one-indexed) at Plc

plc_next_elem :: Eq t => [t] -> t -> t

Element in x after i, the element after the last is the first.

map (plc_next_elem "abcd") "abcd" == "bcda"

plc_next_edge :: Plc -> (Int, Int) -> (Int, Int)

The next edge in Plc following e.

plc_face_from :: Plc -> (Int, Int) -> [(Int, Int)]

The face of Plc starting at e (one-indexed edges).

plc_face_set :: Plc -> [[(Int, Int)]]

The set of all faces at Plc (one-indexed edges).

plc_to_g :: Plc -> G

Translate Plc into un-directed G. Plc is one-indexed, G is zero-indexed.

plc_stat :: FilePath -> IO (Int, [(Int, Int, Int)])

plc_stat_txt :: FilePath -> (Int, [(Int, Int, Int)]) -> [String]

g6_planarg :: [String] -> IO ByteString

Run "nauty-planarg" to convert (if possible) a set of G6 graphs to Planar-Code.

g_to_plc :: [G] -> IO [Plc]

plc_parse of g6_planarg of g_to_g6

g6_to_pl_wr :: FilePath -> FilePath -> IO ()

Run "nauty-planarg" to translate named G6 file to named PL file.