| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Music.Theory.Graph.Lgl
Description
LGL = Large Graph Layout (NCOL, LGL)
Synopsis
- type Ncol_Ent t = ((t, t), Maybe Double)
- type Ncol t = [Ncol_Ent t]
- ncol_parse :: Read t => String -> Ncol_Ent t
- ncol_load :: Read t => FilePath -> IO (Ncol t)
- ncol_load_int :: FilePath -> IO (Ncol Int)
- ncol_ent_format :: Show t => Int -> Ncol_Ent t -> String
- ncol_store :: Show t => Int -> FilePath -> Ncol t -> IO ()
- ncol_store_int :: Int -> FilePath -> Ncol Int -> IO ()
- ncol_rewrite_eset :: Ord t => [(t, t)] -> [(t, t)]
- eset_to_ncol :: Ord t => [(t, t)] -> Ncol t
- ncol_to_eset :: Ncol t -> [(t, t)]
- ncol_store_eset :: (Ord t, Show t) => FilePath -> [(t, t)] -> IO ()
- type Lgl t = [(t, [(t, Maybe Double)])]
- lgl_format :: Show t => Int -> Lgl t -> String
- lgl_store :: Show t => Int -> FilePath -> Lgl t -> IO ()
- adj_to_lgl :: Adj t -> Lgl t
- lgl_to_adj :: Lgl t -> Adj t
- lgl_store_adj :: Show t => FilePath -> Adj t -> IO ()
Ncol
ncol_ent_format :: Show t => Int -> Ncol_Ent t -> String Source #
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_rewrite_eset :: Ord t => [(t, t)] -> [(t, t)] Source #
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 Source #
eset (edge-set) to Ncol (runs ncol_rewrite_eset)
ncol_to_eset :: Ncol t -> [(t, t)] Source #
Inverse of eset_to_ncol, error if Ncol is weighted
Lgl
lgl_format :: Show t => Int -> Lgl t -> String Source #
Format Lgl, k is floating point precision for optional weights.
lgl_to_adj :: Lgl t -> Adj t Source #
Inverse of adj_to_lgl, error if Lgl is weighted