Music.Theory.Graph.Dot

Graph (dot) functions.

UTIL

sep1 :: Eq t => t -> [t] -> ([t], [t])

Separate at element.

sep1 ':' "graph:layout"

maybe_quote :: String -> String

Quote s if it includes white space.

map maybe_quote ["abc","a b c"] == ["abc","\"a b c\""]

assoc_union :: Eq k => [(k, v)] -> [(k, v)] -> [(k, v)]

Left biased union of association lists p and q.

assoc_union [(5,"a"),(3,"b")] [(5,"A"),(7,"C")] == [(5,"a"),(3,"b"),(7,"C")]

ATTR

type DOT_KEY = String

area:opt (area = graph|node|edge)

type DOT_OPT = String

type DOT_VALUE = String

type DOT_ATTR = (DOT_OPT, DOT_VALUE)

type DOT_ATTR_SET = (String, [DOT_ATTR])

dot_key_sep :: String -> (String, String)

dot_attr_pp :: DOT_ATTR -> String

dot_attr_set_pp :: DOT_ATTR_SET -> String

dot_attr_collate :: [DOT_ATTR] -> [DOT_ATTR_SET]

dot_attr_ext :: [DOT_ATTR] -> [DOT_ATTR] -> [DOT_ATTR]

dot_attr_def :: [DOT_ATTR]

GRAPH

type GR_PP v e = (v -> Maybe String, v -> Maybe String, e -> Maybe String)

Graph pretty-printer, (node->shape,node->label,edge->label)

gr_pp_lift_node_f :: (v -> String) -> GR_PP v e

gr_pp_id_show :: Show e => GR_PP String e

br_csl_pp :: Show t => [t] -> String

br = brace, csl = comma separated list

gr_pp_id_br_csl :: Show e => GR_PP String [e]

data G_TYPE

Graph type, directed or un-directed.

Constructors

G_DIGRAPH

G_UGRAPH

g_type_to_string :: G_TYPE -> String

g_type_to_edge_symbol :: G_TYPE -> String

type POS_FN v = v -> (Int, Int)

Vertex position function.

g_to_dot :: G_TYPE -> [DOT_ATTR] -> GR_PP v e -> Maybe (POS_FN v) -> Gr v e -> [String]

g_to_udot :: [DOT_ATTR] -> GR_PP v e -> Gr v e -> [String]