Search Results for "avl tree visualization java"

Coca is a toolbox that is design for legacy system refactoring and analysis, including call graph, concept analysis, api tree, and design patterns suggestions. Requirements: graphviz for dot file to image (such as svg, png). The easiest way to get coca is to use one of the pre-built release binaries which are available for OSX, Linux, and Windows on the release page.

Efficiently create compact, highly customizable tree layouts - Based on Walker's algorithm with enhancements suggested by Buchheim, Jünger, and Leipert the software builds tree layouts in linear time. I.e. even trees with many nodes are built fast. Downloads are available at https://sourceforge.net/projects/treelayout/files/. For detailed documentation look at the TreeLayout web site http://treelayout.sourceforge.net/. Development for TreeLayout has moved to...

Realtime bigdata tool at the bit level based on immutable AVL forest which can be run in memory or, in future versions, as a merkle forest like a blockchain. Main object is a sparse bit string (Bits) that efficiently scales up to 2^63 bits normally compressed as forest has duplicated substrings. Bits objects support reading bit, byte, short, int, or long (Java primitives) at any bit index in 64 bit range. Example: instead of building a class to hold a header and then data, represent all of...

JTreeMap is a Swing Component which represents a tree structure with rectangles (a TreeMap. See http://www.cs.umd.edu/hcil/treemap/). KTreeMap is the SWT component for treemapping (see http://en.wikipedia.org/wiki/Treemapping). It is an Eclipse plugin.

A Java API for using suffix trees with natural language and an Eclipse/SWT-based GUI for suffix tree visualization using Graphviz.

Nested pie chart is for tree visualization. Each node of the tree has a size and color attribute, enabling the chart to be used as a heatmap. Linear arrangement of the nodes in decreasing order of size is an advantage over rectangular heatmaps.

Web interface to a prolog interpreter, where you can load prolog programs, do consults, and visualize the resolution tree in SVG.

Simple editor and analyzer of Petri nets. It allows you to build reachability tree with/without instant transitions and Markov chains. It is also possible to set transition distributions and set all the parameters of the current distribution. This project was made as a course project at NTUU "KPI" during attending classes "Computer modelling". Feel free to make any changes to the current version or ask me if you have any question.