The treeviz package

[Tags: bsd3, library]

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

[Skip to ReadMe]


Versions0.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
Change logNone available
Dependenciesbase (>=2 && <5), containers, mtl, QuickCheck, random [details]
CopyrightCopyright (c) 2013 David Banas; all rights reserved World wide.
AuthorDavid B. Banas
CategoryAlgorithm Visualization
Home page
Source repositoryhead: git clone git://
this: git clone git:// v2.0.3)
UploadedSun Oct 18 15:26:57 UTC 2015 by DavidBanas
Downloads1643 total (28 in last 30 days)
0 []
StatusDocs available [build log]
Last success reported on 2015-10-18 [all 1 reports]




Maintainers' corner

For package maintainers and hackage trustees

Readme for treeviz-2.0.3

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