DataViz.Layout.Hierarchy.EdgeBundle.Bilink

type BilinkedTree a = BilinkedNode a

Type alias for the complete bilinked tree

data BilinkedNode a

A node with bidirectional link information

Constructors

• BilinkedNode { children :: Array (BilinkedNode a), data_ :: Maybe a, depth :: Int, fullName :: String, height :: Int, incoming :: Array Link, name :: String, outgoing :: Array Link }

Instances

• (Show a) => Show (BilinkedNode a)

newtype Link

A link between two nodes

Constructors

• Link { source :: String, target :: String }

Instances

• Eq Link
• Show Link

bilink :: forall a. (a -> Array String) -> TreeNode a -> BilinkedTree a

Create bidirectional links from a hierarchy and import data

Algorithm:

1. Build a map from fullName -> leaf node
2. For each leaf with imports, create outgoing links
3. For each outgoing link, add corresponding incoming link to target

Takes:

• A tree built from buildHierarchy
• A function to get imports from the leaf data

getLinks :: forall a. BilinkedTree a -> Array Link

Get all links in the tree

getOutgoing :: forall a. BilinkedNode a -> Array Link

Get outgoing links from a node

getIncoming :: forall a. BilinkedNode a -> Array Link

Get incoming links to a node

getBilinkedData :: forall a. BilinkedNode a -> Maybe a

Get the data from a bilinked node

getBilinkedChildren :: forall a. BilinkedNode a -> Array (BilinkedNode a)

Get children of a bilinked node

getBilinkedFullName :: forall a. BilinkedNode a -> String

Get full name of a bilinked node

allBilinkedNodes :: forall a. BilinkedNode a -> Array (BilinkedNode a)

Get all nodes in the tree (pre-order)

allBilinkedLeaves :: forall a. BilinkedNode a -> Array (BilinkedNode a)

Get all leaf nodes from a bilinked tree