Search Results for "call graph visualization"

JPlotter is an open source math plotter that can draw graphs of arbitrary mathematical functions. Some of the special features are plotting of the derivatives, area calculation, plotting of directional fields of differential equations and plotting of phase and amplitude graph of complex functions.

A spring-based 3D graph layout tool written in Java. Rendering is performed in OpenGL via the JOGL library.

JAGAL provides implementations for directed graphs (weighted and unweighted) and varoius types of transition systems as well as utils for graph traversal and modification. JAGAL builds upon the Java library TOVAL (located at http://sourceforge.net/p/toval). To use JAGAL, make sure the TOVAL library is on the build path. This library uses and encloses jGraphX (https://github.com/jgraph/jgraphx). A documentation for JAGAL can be found under http://doku.telematik.uni-freiburg.de/jagal.

A math application written in Java. Its features include 2D and 3D graph plotting, scripting, user-defined variables and functions and skinnable GUI. This project is not maintained at the moment.

A rich client to analyse data from a liquid-feedback (http://liquidfeedback.org/) instance, for now it's a 3d graph explorer to inspect the delegations. It's an application based on the eclipse platform (indigo). To be precise its a directed weighted multi graph browser in 3d. Find out more in the wiki https://sourceforge.net/p/lqfbanalyser/wiki/Home/ . Generated reports https://sourceforge.net/p/lqfbanalyser/wiki/generated%20lqfb%20reports/ .

Graph visualization using hyperbolic geometry (hyperbolic trees, but also general graphs). Applications cover web site structures, topic maps, organisational charts and wikis.

Software for graphs visualization, encouraging graph algorithms implementation. Aimed at students who want to code their own algorithms and see a graphical representation of it working.

Graph polynomials and view prime numbers on a ulam spiral graphing plot. Only integer numbers. Based on an old GPL version of the JEP equation parser. See website for additional examples/live applets Seems to be closely related to Cellular automaton.

Seems to be closely related to Cellular automaton, except this creates a complex pattern from a mathematical function you input. See website for examples/live applets. This program makes use of an old GPL version of the JEP equation parser.

JUNG provides a common and extendible language for the modeling, analysis, and visualization of data that can be represented as a graph or network. New version now available on GitHub: https://github.com/jrtom/jung/releases/tag/jung-2.1

G.A.V. (Graph Algorithm Visualizer) is a tool that visualizes algorithms from graph theory. A step-by-step visualization from each different algorithm allows the user to understand the particular algorithm very easily.

GrALoG is a tool for editing and visualising graph-like-structures and the results of algorithms running on them. Through it's plugins GrALoG is hugely extendable, i.e. plugin-developers can define their own graph-like structures and algorithms.

AbuGraph is a freely available Java application for the layout and visualization of directed graphs. Bound to a TCP port, it supports dynamic graph creation receiving commands from a telnet console or another third party application.

Simple Java Graph is a minimal matrix- and listbased graph implementation. An AStar search algorithm is also available.

Graph Theorizer will be a java application that will help to teach and research Graph Theory. We will support Windows, Linux, and Mac in our first releases, while hopefully moving towards any platform that supports Java Standard Editon.

Digital graph 1.3 is an advanced JAVA SWING component for modelling, displaying, saving and loading graphs(using XML and XMLSchema). It is fully documented and requires jdk 1.5.x.Version 1.3 adds 9 bug fixs, 3 rengineering and 4 new features.

Goal of Coatie3D project is the development of a 3D graph drawer/ viewer. The purpose of graph drawing is the identification of a pleasant layout for a given graph.