Module

DataViz.Layout.Sankey.Compute

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

Pure PureScript implementation of Sankey diagram layout computation. Uses State monad to thread graph model through all layout functions. Starts with Array SankeyLinkInput and generates nodes dynamically.

Reference: https://github.com/d3/d3-sankey (ISC License)

#epsilon Source

epsilon :: Number

#computeLayout Source

computeLayout :: Array LinkCSVRow -> Number -> Number -> SankeyLayoutResult

Main entry point: Compute Sankey layout with default configuration Takes array of link inputs with named nodes (from CSV parsing)

#computeLayoutWithConfig Source

computeLayoutWithConfig :: Array LinkCSVRow -> SankeyConfig -> SankeyLayoutResult

Compute Sankey layout with custom configuration This is the main algorithm using State monad to thread the graph model

Modules: DataViz.Layout.Adjacency; DataViz.Layout.Adjacency.Layout; DataViz.Layout.Adjacency.Types; 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.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