Module

DataViz.Layout.BlockCutTree

Package: purescript-hylograph-layout
Repository: afcondon/purescript-hylograph-layout

Block-Cut Tree Layout

Positions nodes of a graph based on its biconnected component decomposition. Biconnected components (blocks) are arranged in BFS layers from the largest block outward; nodes within each block are arranged in a circle around the block center. Isolated nodes (no edges) are placed along the bottom.

This layout is useful for visualizing the structural decomposition of code modules, social networks, or any graph where cluster structure matters.

#BlockCutLayout Source

type BlockCutLayout node = { blocks :: Map Int BlockLayout, height :: Number, nodes :: Map node NodeLayout, width :: Number }

Complete layout result

#BlockCutConfig Source

type BlockCutConfig = { blockRadiusScale :: Number, height :: Number, isolatedGap :: Number, isolatedSpacing :: Number, layerGap :: Number, margin :: Number, maxBlockRadius :: Number, minBlockRadius :: Number, minHeight :: Number, width :: Number }

Configuration for the layout algorithm

#NodeLayout Source

type NodeLayout = { block :: Int, isArticulationPoint :: Boolean, isIsolated :: Boolean, x :: Number, y :: Number }

Per-node layout result

#BlockLayout Source

type BlockLayout = { depth :: Int, isBridge :: Boolean, nodeCount :: Int, radius :: Number, x :: Number, y :: Number }

Per-block layout result

#defaultConfig Source

defaultConfig :: BlockCutConfig

Sensible defaults

#layout Source

layout :: forall node. Ord node => BlockCutConfig -> SimpleGraph node -> BlockCutLayout node

Compute positions for all nodes in a graph based on its block-cut tree decomposition.

Modules: DataViz.Layout.Adjacency; DataViz.Layout.Adjacency.Layout; DataViz.Layout.Adjacency.Types; DataViz.Layout.BlockCutTree; DataViz.Layout.Chord; DataViz.Layout.Chord.Layout; DataViz.Layout.Chord.Types; DataViz.Layout.Hierarchy.Cluster; DataViz.Layout.Hierarchy.Core; DataViz.Layout.Hierarchy.EdgeBundle; DataViz.Layout.Hierarchy.EdgeBundle.Bilink; DataViz.Layout.Hierarchy.EdgeBundle.BundleCurve; DataViz.Layout.Hierarchy.EdgeBundle.Hierarchy; DataViz.Layout.Hierarchy.EdgeBundle.RadialCluster; DataViz.Layout.Hierarchy.EdgeBundle.Types; DataViz.Layout.Hierarchy.Link; DataViz.Layout.Hierarchy.Pack; DataViz.Layout.Hierarchy.Partition; DataViz.Layout.Hierarchy.Tree; DataViz.Layout.Hierarchy.TreeStyle; DataViz.Layout.Hierarchy.Treemap; DataViz.Layout.Hierarchy.Types; DataViz.Layout.Pattern; DataViz.Layout.Pattern.Adapters; DataViz.Layout.Pattern.Types; DataViz.Layout.Sankey.CSV; DataViz.Layout.Sankey.Compute; DataViz.Layout.Sankey.ComputeWithSteps; DataViz.Layout.Sankey.Path; DataViz.Layout.Sankey.Types; DataViz.Layout.StateMachine; DataViz.Layout.StateMachine.Layout; DataViz.Layout.StateMachine.Path; DataViz.Layout.StateMachine.Types