Search Results for "avl tree visualization java"
Sort By:
Showing 8 open source projects for "avl tree visualization java"
View related business solutions-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
Keep company data safe with Chrome EnterpriseMake AI work your way with Chrome Enterprise. Block unapproved sites and set custom data controls that align with your company's policies.
-
1
Coca
Coca is a toolbox which is design for legacy system refactoring
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. -
2
TreeLayout
Efficient and customizable TreeLayout Algorithm in Java, for NetBeans
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... -
3
Immutable Sparse Wave Trees (WaveTree)
Realtime bigdata tool for bit strings up to 2^63 based on AVL forest
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... -
4
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.
-
Level Up Your Cyber Defense with External Threat ManagementMove beyond alerts. Gain full visibility, context, and control over your external attack surface to stay ahead of every threat.
-
5
A Java API for using suffix trees with natural language and an Eclipse/SWT-based GUI for suffix tree visualization using Graphviz.
-
6
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.
-
7
Web interface to a prolog interpreter, where you can load prolog programs, do consults, and visualize the resolution tree in SVG.
-
8
Petri Nets Editor
Simple petri net editor
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.
- Previous
- You're on page 1
- Next
