KaHIP - Karlsruhe High Quality Partitioning - is a family of graph partitioning programs that tackle the balanced graph partitioning problem. It focuses on solution quality and implements flow-based methods, more-localized local searches, and several parallel and sequential meta-heuristics.
PHP Chart is an AJAX control for generating dynamic charts and graphics. No PHP GD or any other third party graphic libraries are required on your server. The phpChart has amazing rendering speed because all graphics are completely processed in the Web browser on the client side, thus saving your valuable server resources. It supports all major charting graphs such as pie, bar, scatter, balloon, radar, bubble, zooming, candlestick, block, curve, donuts charts, and much more.
twyg lets you visualise arbitrary tree structures in a pretty way. The appearance of the tree (layout, color, node, connection shapes, etc.) is fully controlled via configuration files in a generative way. This means that almost all visual properties of the output can be controlled by expressions that depend on the characteristics of the tree (e.g. the color or shape of a node can be a function of its hierarchical position in the tree). This allows for crafting very flexible configurations that can be applied to trees of arbitrary size and complexity. It supports the Cairo and NodeBox1 rendering backends.
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.
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.
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.
yEd is a powerful diagram editor which can be used to quickly create diagrams manually or import external data for analysis and auto-magically arrange even large data sets by just pressing a button. You can use yEd to quickly create flow charts, BPMN and UML diagrams, organization charts, mind maps, Entity Relationship diagrams, and many other kinds of diagrams, graphs, and networks. Choose from a wide range of highly sophisticated layout algorithms to automatically arrange diagrams in no time. An intuitive and visually appealing user interface makes creating diagrams fun. Once a diagram has been created, it's easy to save, print, or export it to popular formats like PDF, SWF, EMF, SVG, JPEG, GIF, PNG, or HTML image maps.