Sound.DF.Graph

Graph analysis

Documentation

nodes :: Node -> [Node]

List of nodes, in left biased order.

label :: [(NodeID, Node)] -> Node -> NodeID

Read label of node.

source :: [(NodeID, Node)] -> Node -> (NodeID, PortID)

Transform node to source, see through rec_r and proxy and mrg.

type Edge = ((NodeID, PortID), (NodeID, PortID))

Edge between ports.

edges :: [(NodeID, Node)] -> Node -> [Edge]

List incoming node edges,

analyse :: [Node] -> [((NodeID, Node), [Edge])]

Label nodes and list edges. Proxy and multiple-root nodes are erased.

mod_e :: Edge -> (NodeID, NodeID, (PortID, PortID))

Transform edge into form required by fgl.

graph :: Node -> Gr Node (PortID, PortID)

Generate graph.

tsort :: Node -> [Node]

Topological sort of nodes (via graph).