Select a tag to browse associated projects and drill deeper into the tag cloud.
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]
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]
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]
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]
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 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.
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.
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.
Copyright © 2013 Black Duck Software, Inc. and its contributors, Some Rights Reserved. Unless otherwise marked, this work is licensed under a Creative Commons Attribution 3.0 Unported License . Ohloh ® and the Ohloh logo are trademarks of Black Duck Software, Inc. in the United States and/or other jurisdictions. All other trademarks are the property of their respective holders.