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.
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.
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.
Qtnp is program for math\physics teachers and students. There 4 tools: Pen, Line, Jogged line, and Circle. The software can draw grids, coordinate planes, and graphics. It has flexible settings, presentation mode, support for all base formats, a GUI for blackboards/tablets, and a built-in powerful calculator.
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.
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.