| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Data.Sifflet.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) e Source
orderedTreeToGraph :: Tree e -> Gr e WEdge Source
treeGraphNodesTree :: Tree e -> Tree Node Source
graphToTreeOriginal :: Gr e () -> Node -> Tree e Source
Deprecated: use ??? instead
flayoutToGraphRoots :: FunctoidLayout -> [Node] Source
graphToOrderedTree :: Gr e WEdge -> Tree e Source
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 e Source
grTranslateSubtree :: Node -> Double -> Double -> LayoutGraph n e -> LayoutGraph n e Source
grTranslateGraph :: Double -> Double -> LayoutGraph n e -> LayoutGraph n e Source