Renamed to digital-society-coop/elm-tree-layout. It is published under that name, and new versions come out there.
Versions published as wasdacraic/elm-tree-layout still install under that name. 2 versions of 2 come from the new location (see their notes).
Rerouted (renamed, verified). The GitHub user or repository was renamed. The tag is still there, at the new name. The Lamdera package server serves a copy recovered from https://github.com/digital-society-coop/elm-tree-layout.
What we checked: The repo moved to github.com/digital-society-coop/elm-tree-layout. Rebuilt with git archive from commit 60cb32d445cc of https://github.com/digital-society-coop/elm-tree-layout (zip prefix wasdacraic-elm-tree-layout-60cb32d/, America/Los_Angeles times): the zip is byte-identical to the one package.elm-lang.org recorded, SHA-1 a1c9d2b1b3dc78d0a247543ca948fbc09ccf7c80.
The Lamdera compiler uses this copy and prints a one-line notice saying so. elm itself fails to download this version.
Details · package.elm-lang.org's zip: https://github.com/wasdacraic/elm-tree-layout/zipball/1.0.1/
Elm implementation of Buchheim, Junger and Leipert's tree layout algorithm.
This package exposes treeLayout, which returns a dictionary of node identifiers with x and y coordinates
for a given 'distance' (used as a constant for x spacing) and 'nodes'
(a list of hierarchy descriptors starting with the root, represented by tuples of node identifier and parent node identifier).
Example usage:
treeLayout 2 [ ( "a", Nothing ), ( "b", Just "a" ), ( "c", Just "a" ) ]
--> (Dict.fromList [ ( "a", { x = 0, y = 1 } ), ( "b", { x = -1, y = 2 } ), ( "c", { x = 1, y = 2 } ) ])The pseude code written by (Buchheim, Junger and Leipert, 2006) implements aesthetic rules defined by (Walker, 1989) in a linear time for trees of unbounded degree.
This library does not render the tree, so that the rendering logic could be kept separate.