Safe Haskell	Safe-Inferred
Language	Haskell2010

Music.Theory.Graph.Lcf

Description

Lcf (LederbergCoxeterFrucht) notation

The notation only applies to Hamiltonian graphs, since it achieves its symmetry and conciseness by placing a Hamiltonian cycle in a circular embedding and then connecting specified pairs of nodes with edges. (EW)

Synopsis

type Lcf = ([Int], Int)
type R = Double
lcf_seq :: Lcf -> [Int]
lcf_degree :: Lcf -> Int
lcf_to_edg :: Lcf -> Edg
edg_circ_gr :: R -> Edg -> Lbl (R, R) ()
lcf_mw_set :: [(String, Lcf)]

Documentation

type Lcf = ([Int], Int) Source #

Lcf notation (l,k). ([3,-3],4) is the cubical graph.

type R = Double Source #

Real, alias for Double

lcf_seq :: Lcf -> [Int] Source #

Sequence, ie. l k times.

lcf_degree :: Lcf -> Int Source #

Length of lcf_seq, ie. |l|k

lcf_to_edg :: Lcf -> Edg Source #

Lcf to Edg (an edge list)

edg_circ_gr :: R -> Edg -> Lbl (R, R) () Source #

Lcf edge-list to graph labeled with circular co-ordinates.

lcf_mw_set :: [(String, Lcf)] Source #

Lcf graph set given at http://mathworld.wolfram.com/LcfNotation.html

length lcf_mw_set == 57
length (nub (map snd lcf_mw_set)) == 57 -- IE. UNIQ