| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Graph.SubGraphWindows
Synopsis
- subgraphWindows :: (NodeClass n, EdgeClass e, ShowGraph n e, Unbox UINode) => (NestMap, [BoxId]) -> (CGraphL n e, [[UINode]]) -> [(Nesting, BoxId, (Min, Max), (Min, Max))]
- subgraphWithWindows :: (NodeClass n, EdgeClass e, ShowGraph n e, Unbox UINode) => (NestMap, [BoxId]) -> (CGraphL n e, [[UINode]]) -> (CGraphL n e, [[UINode]])
- getColumns :: EdgeClass e => CGraphL n e -> (Map X [UINode], Map Int ([Column], YBlockLines))
- getRows :: CGraphL n e -> Map Y [UINode]
- type ShowGraph n e = (Enum n, ExtractNodeType n, Show n, Show e)
- type NestMap = Map Nesting (Set BoxId)
Documentation
subgraphWindows :: (NodeClass n, EdgeClass e, ShowGraph n e, Unbox UINode) => (NestMap, [BoxId]) -> (CGraphL n e, [[UINode]]) -> [(Nesting, BoxId, (Min, Max), (Min, Max))] Source #
Returns the boxes of the graph by examining the boxID of the cell
subgraphWithWindows :: (NodeClass n, EdgeClass e, ShowGraph n e, Unbox UINode) => (NestMap, [BoxId]) -> (CGraphL n e, [[UINode]]) -> (CGraphL n e, [[UINode]]) Source #
Adds windows by changing the border property of every cell by examining the boxID of the cell
getColumns :: EdgeClass e => CGraphL n e -> (Map X [UINode], Map Int ([Column], YBlockLines)) Source #
To be able to jump vertically between nodes in an interactive ui