| Safe Haskell | Safe-Infered | 
|---|
Sifflet.Data.TreeGraph
- type LayoutGraph n e = Gr (LayoutNode n) e
 - flayoutToGraph :: FunctoidLayout -> WGraph
 - treeLayoutToGraph :: TreeLayout ExprNode -> WGraph
 - orderedTreeToGraph :: Tree e -> Gr e WEdge
 - treeGraphNodesTree :: Tree e -> Tree Node
 - graphToTreeOriginal :: Gr e () -> Node -> Tree e
 - graphToTreeStructure :: Gr n e -> Node -> Tree Node
 - flayoutToGraphRoots :: FunctoidLayout -> [Node]
 - graphToOrderedTree :: Gr e WEdge -> Tree e
 - graphToOrderedTreeFrom :: Gr e WEdge -> Node -> Tree e
 - orderedChildren :: Gr e WEdge -> Node -> [Node]
 - adjCompareEdge :: (Node, WEdge) -> (Node, WEdge) -> Ordering
 - nextNodes :: [e] -> Node -> ([Node], Node)
 - grTranslateNode :: Node -> Double -> Double -> LayoutGraph n e -> LayoutGraph n e
 - grTranslateSubtree :: Node -> Double -> Double -> LayoutGraph n e -> LayoutGraph n e
 - grTranslateGraph :: Double -> Double -> LayoutGraph n e -> LayoutGraph n e
 - functoidToFunction :: Functoid -> WGraph -> Node -> Env -> SuccFail Function
 - graphToExprTree :: WGraph -> Node -> Tree ExprNode
 
Documentation
type LayoutGraph n e = Gr (LayoutNode n) eSource
orderedTreeToGraph :: Tree e -> Gr e WEdgeSource
treeGraphNodesTree :: Tree e -> Tree NodeSource
graphToOrderedTree :: Gr e WEdge -> Tree eSource
orderedChildren :: Gr e WEdge -> Node -> [Node]Source
List of the nodes children, ordered by edge number
grTranslateNode :: Node -> Double -> Double -> LayoutGraph n e -> LayoutGraph n eSource
grTranslateSubtree :: Node -> Double -> Double -> LayoutGraph n e -> LayoutGraph n eSource
grTranslateGraph :: Double -> Double -> LayoutGraph n e -> LayoutGraph n eSource