Projects

NetworkX

claimed by Los Alamos National Lab

NetworkX (NX) is a Python package for the creation, manipulation, and study of the structure, dynamics, and functions of complex networks. Features: * Includes standard graph-theoretic and statistical physics functions * Easy exchange of network algorithms between applications, disciplines ... [More] , and platforms * Includes many classic graphs and synthetic networks * Nodes and edges can be "anything" (e.g. time-series, text, images, XML records) * Exploits existing code from high-quality legacy software in C, C++, Fortran, etc. * Open source (encourages community input) * Unit-tested Additional benefits due to Python: * Allows fast prototyping of new algorithms * Easy to teach * Multi-platform * Allows easy access to almost any database [Less]

graph-tool

graph-tool is a python module to help with statistical analysis of graphs. Its feature set includes support for both directed and undirected graphs with arbitrary vertex and edge properties, edge/vertex filtering, correlated random graph generation and community detection. It supports also ... [More] several statistical measurements, such as: degree histogram, combined degree histogram, vertex-vertex degree correlation, average nearest neighbours degree, vertex-edge-vertex correlation, clustering coefficients, extended clustering coefficient, assortativity coefficient, betweenness centrality, average distance, component statistics and reciprocity. The core algorithms are written in C++, making use of the Boost Graph Library, and template metaprogramming techniques, with performance in mind. [Less]

igraph library

This is another library for creating and manipulating graphs. There is simply no other graph library out there which can be handle graphs of the size the author is confronted with efficiently. Whenever possible igraph tries to be also user friendly and portable. igraph started as an additional ... [More] package to the GNU R statistical environment, and still some functions which are hard to implement in C are available only in R (like interactive graphics). Most functions are however now written in C and they can be compiled without R as a separate library. [Less]

TSP Solver and Generator

TSPSG is intended to generate and solve Travelling Salesman Problem (TSP) tasks. It uses the Branch and Bound method for solving. Its input is a number of cities and a matrix of city-to-city travel costs. The matrix can be populated with random values in a given range (which is useful for generating ... [More] tasks). The result is an optimal route, its price, step-by-step matrices of solving, and a solving graph. The task can be saved in an internal binary format and opened later. The result can be printed or saved as PDF, HTML, or ODF. TSPSG may be useful for teachers to generate test tasks or just for regular users to solve TSPs. Also, it may be used as an example of using Branch and Bound method to solve a particular task. [Less]

QuickGraph, Graph Data Structures And

QuickGraph 3.0 provides *generic* directed graph datastructures and algorithms for them. It also comes with algorithms such as depth first seach, breath first search, shortest path, network flow etc... and takes full advantage of the C# 3.0 features.

WPFGraph

WPFGraph is a tool to create animations of graph algorithms using a WPF based 3D rendering engine. You can create a graph by adding nodes and edges to the UI simply by using your mouse. Then you can execute a graph algorithm like Dijkstra on the created graph.

graphmining

This is for class project. May not be useful for you.

graphxt

A Graph visualization software focused on graph creation and dynamic animations showing some basic algorithms functioning. It has a plugin system which facilitates the introduction of new algorithms in the software.

tinkerpop's furnace

A Property Graph Algorithms Package

gpath

GPath is an evolutionary graph search algorithm that tries to solve the single-source shortest path problem for a graph, in which each node has a coordinate attached. It's based on the idea of chemotaxis, the method by which many single and multi-cellular organisms find their food.