Music.Theory.Graph.Lgl

LGL = Large Graph Layout (NCOL, LGL)

http://lgl.sourceforge.net/#FileFormat

Ncol

type Ncol_Ent t = ((t, t), Maybe Double)

(edge,weight)

type Ncol t = [Ncol_Ent t]

ncol-entry

ncol_parse :: Read t => String -> Ncol_Ent t

Parse Ncol_Ent from String

ncol_load :: Read t => FilePath -> IO (Ncol t)

Load Ncol from .ncol file.

ncol_load_int :: FilePath -> IO (Ncol Int)

Type-specialised.

ncol_ent_format :: Show t => Int -> Ncol_Ent t -> String

Format Ncol_Ent.

ncol_ent_format 4 ((0,1),Nothing) == "0 1"
ncol_ent_format 4 ((0,1),Just 2.0) == "0 1 2.0000"

ncol_store :: Show t => Int -> FilePath -> Ncol t -> IO ()

Store Ncol of Int to .ncol file

ncol_store_int :: Int -> FilePath -> Ncol Int -> IO ()

Type-specialised.

ncol_rewrite_eset :: Ord t => [(t, t)] -> [(t, t)]

Ncol data must be un-directed and have no self-arcs. This function sorts edges (i,j) so that i <= j and deletes edges where i == j.

eset_to_ncol :: Ord t => [(t, t)] -> Ncol t

eset (edge-set) to Ncol (runs ncol_rewrite_eset)

ncol_to_eset :: Ncol t -> [(t, t)]

Inverse of eset_to_ncol, error if Ncol is weighted

ncol_store_eset :: (Ord t, Show t) => FilePath -> [(t, t)] -> IO ()

ncol_store of eset_to_ncol

Lgl

type Lgl t = [(t, [(t, Maybe Double)])]

Lgl is an adjaceny set with optional weights.

lgl_format :: Show t => Int -> Lgl t -> String

Format Lgl, k is floating point precision for optional weights.

lgl_store :: Show t => Int -> FilePath -> Lgl t -> IO ()

writeFile of lgl_format

adj_to_lgl :: Adj t -> Lgl t

adj (adjaceny-set) to Lgl.

lgl_to_adj :: Lgl t -> Adj t

Inverse of adj_to_lgl, error if Lgl is weighted

lgl_store_adj :: Show t => FilePath -> Adj t -> IO ()

lgl_store of adj_to_lgl