GUESS, or the Graph Exploration System, is a system and language for visualizing and manipulating graph structures and creating new visualization applications.
callgraph is a project that provides an algorithm for an optimal vertex positioning of any connected graph in 3D, as well as the library and sample application for viewing graphs in 3D.
Java Framework for automatic transformation of graph structured Process Models (incl. BPMN import) to block structured BPEL code. A graphical tool is provided for visualisation and testing.
sarface is a user-interface to the sysstat/sar database which inputs data from sar and plots to a live X11 graph via gnuplot. It mimics the cmd-line options from sar but can cross-plot any two or more stats and apply simple mathematical functions them.
Fiona is a tool to automatically analyze the interactional behavior of a given oWFN. It provides two techniques: it checks for the controllability of the given net by computing the interactiong graph and it calculates the operating guideline for the net.
A simple (~20 line python) O(n^6) algorithm for the traveling salesman problem that seems to do pretty well for most graphs; so well that I have not been able to find a graph which it does optimally solve. Those with spare cycles are welcome to help out.
A collection of miscellaneous Java utilities, including a standard enumerated type base class, multithreading utilities, graph utilities, and several generalizations / augmentations of the Java Collections API (e.g. MultiMap, ListDiff).
This navigation tool for the site http://www.software-kompetenz.de visualizes a connection graph of articles in a knowledge database. It is a project of the Software Systems Engineering Research Group at the BTU Cottbus and cooperating partners.
FORce based Cluster Editing (FORCE) is a Java software heuristically solving the graph cluster editing problem on weighted edges using BLAST E-values. It further provides a training mode for heuristic parameter estimation.
An adaptive mini database learns algorithmic operations for data intensive algebraic computational methods within a pervasive computing graph. It also provides generic structures and algorithms as a data fabric.
Self Organization of an adaptive learning framework for pervasive graph structures from grids, utilities to semantic governance. Business, performance and provisioning assurance are converged with EGA, ITIL, eTOM,SOX, HIPPA, CobiT and AC
Library of terrain level of detail algorithm nodes for Coin (an implementation of an Open Inventor scene graph) and other utility classes. Currently are implemented ROAM, Geo Mip-Mapping and Chunked-LoD algorithms. Any issues and feedback for this projec
pythag is an algorithm and script for computing primitive Pythagorean triples using the command line. Has an option to output to a file. It also has an option to output to a graph using GLUT, to which it now depends.
A toolkit for developing virtual reality applications. Built in C++, over OpenGL, it is object oriented and offers the use of a scene graph for object hierarchy. Also, it provides interfaces for using VR equipment such as tracking devices.
Dynagraph for Windows is a graph editor and front-end for the platform-independent Dynagraph graph layout engines. It consists of the Montage OLE Client-Server library, COM wrappers for Dynagraph, and graph editing components.
Domify is a Java library which adapts an arbitrary graph of Java objects to a W3C DOM interface. The DOM nodes are lazy-loaded to minimize processing overhead.
Famework to persist an EMF object-graph remotely. It uses a SDO DataGraph over SOAP. It has a Hibernate based mediator to communicate with a RDBMS.
In a intranet environment Eclipse RCP + this framework can form an alternative for RIA's.
Blubber system is an Eclipse RCP application for distributed systems modeling. Designed for university researches and inlcudes: task graph editor; graph transformation tools; graph modelling on distributed system; real-time modelling on GerdaFramework.