treeviz: Visualization of computation decomposition trees.

[ algorithm-visualization, bsd3, library ] [ Propose Tags ]

This Haskell package provides some tools for visualizing the decomposition of different divide and conquer algorithms.

[Skip to Readme]
Versions [faq] 0.0.1, 0.0.2, 0.0.3, 0.0.4, 0.0.5, 0.0.6, 0.0.7, 0.0.8, 1.0.0, 2.0.2, 2.0.3
Dependencies base (>=2 && <5), containers, mtl, QuickCheck, random [details]
License BSD-3-Clause
Copyright Copyright (c) 2013 David Banas; all rights reserved World wide.
Author David B. Banas
Category Algorithm Visualization
Home page
Source repo head: git clone git://
this: git clone git:// v0.0.7)
Uploaded by DavidBanas at 2014-04-17T02:46:34Z
Distributions NixOS:2.0.3
Executables treeviz
Downloads 6281 total (7 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Successful builds reported [all 1 reports]




Maintainer's Corner

For package maintainers and hackage trustees

Readme for treeviz-0.0.7

[back to package description]
This is the `TreeViz` library, written by David Banas.

For more info, please, see the comments in `Data/Tree/LogTree.hs`.
Alternatively, view the Haddock generated HTML documentation:
  $ cabal haddock

For usage examples, please, see:
- src/Main.hs

The intent of this library is to provide the data structures, type classes,
and support functions necessary for working with and visualizing computation
decomposition trees. For instance, the initial motivation for creating this
package was the need to visualize how data flow occurs in a fast Fourier
transform (FFT) of arbitrary radices and either decimation style (time or