Advanced Graphs and Charts Collection for PHP provides a very easy way to embed dynamically-generated graphs and charts into PHP applications and HTML Web pages. The Graphing components provide various solutions for the incorporation of graphs and charts into Web/intranet pages and applications. Versatile components provide the ability for Web authors and developers to quickly build and publish dynamic and interactive graphs and charts.
Archipel is a multithreading framework for Java. Threads working together can be seen as a graph in which each thread is a node. That's exactly what Archipel does. The aim is to make multithreading easier. Simply define your data exchange structures and write the business code for each of your threads, and Archipel handles the rest.
Dandelion is a 3D graph rendering application which can be controlled across a network. Its main purpose is to allow clear network graphs to be rendered in a window, which can be controlled by a separate application or the user. The Dandelion visualization is actually controlled by issuing simple commands to it across the network (although this could all be happening on a single machine). The Dandelion source includes a set of very simple libraries which can be incorporated into other applications and which can be used to send these commands. Libraries are included for C, C#, Java, and Python. The project was developed at Liverpool John Moores University within the PROTECT Centre.
GLE (Graphics Layout Engine) is a graphics scripting language designed for creating publication quality figures (e.g., a chart, plot, graph, or diagram). GLE supports various chart types (including function plot, histogram, bar chart, scatter plot, contour plot, color map, and surface plot) through a simple but flexible set of graphing commands. More complex output can be created by relying on GLE's scripting language, which is full featured with subroutines, variables, and logic control. GLE relies on LaTeX for text output and supports mathematical formulae in graphs and figures.
Global Paths Matching is an implementation of the global paths graph matching algorithm proposed by Maue and Sanders in "Engineering Algorithms for Approximate Weighted Matching" (WEA'07). Given a graph G=(V,E), a matching M is a set of edges without common vertices, i.e. the graph G=(V,M) has a degree of at most one. The algorithm scans the edges in order of decreasing weight (or rating), constructing a collection of paths and even length cycles. These paths initially contain no edges. While scanning the edges, the set is extended by successively adding applicable edges, which are those connecting two endpoints of different paths or two endpoints of an odd length path. Optimal solutions/matchings are computed for each path and cycle using dynamic programming.
Hypercube is a graph visualization tool for drawing DOT (graphviz), GML, GraphML, GXL and simple text-based graph representations as SVG and EPS images. It comes with a Qt-based GUI application and a Qt-independent commandline tool. Hypercube uses a simulated annealing algorithm to lay out the graph, which can be easily parameterized to achieve the desired look.