Search Results for "graph algorithms" - Page 3

A threaded Web graph (Power law random graph) generator written in Python. It can generate a synthetic Web graph of about one million nodes in a few minutes on a desktop machine. It implements a threaded variant of the RMAT algorithm.

The Open Optimization for Java provides a framework and the implementation of commonly-used algorithms found in Graph Theory and Network Optimization, e.g. shortest path and postman problem.

A Graph support extension to the java.util collections framework.

A Common Lisp library for representing and manipulating graphs. Algorithms implemented: subgraph isomorphism (Ullman), automorphism, canonicalization (Nauty), connected-components/union-find.

callgraph is a project that provides an algorithm for an optimal vertex positioning of any connected graph in 3D, as well as the library and sample application for viewing graphs in 3D.

Java Framework for automatic transformation of graph structured Process Models (incl. BPMN import) to block structured BPEL code. A graphical tool is provided for visualisation and testing.

Fiona is a tool to automatically analyze the interactional behavior of a given oWFN. It provides two techniques: it checks for the controllability of the given net by computing the interactiong graph and it calculates the operating guideline for the net.

A simple (~20 line python) O(n^6) algorithm for the traveling salesman problem that seems to do pretty well for most graphs; so well that I have not been able to find a graph which it does optimally solve. Those with spare cycles are welcome to help out.

An adaptive mini database learns algorithmic operations for data intensive algebraic computational methods within a pervasive computing graph. It also provides generic structures and algorithms as a data fabric.

yaghi (Yet Another GrapH Implementation) is a Free (as Freedom) Implementation in C++ for the data structure "Graph" using the STL library.

FORce based Cluster Editing (FORCE) is a Java software heuristically solving the graph cluster editing problem on weighted edges using BLAST E-values. It further provides a training mode for heuristic parameter estimation.

Library of terrain level of detail algorithm nodes for Coin (an implementation of an Open Inventor scene graph) and other utility classes. Currently are implemented ROAM, Geo Mip-Mapping and Chunked-LoD algorithms. Any issues and feedback for this projec

An experimental language API and interpreter which combine ideas from functional programming and graph theory.

Blubber system is an Eclipse RCP application for distributed systems modeling. Designed for university researches and inlcudes: task graph editor; graph transformation tools; graph modelling on distributed system; real-time modelling on GerdaFramework.

Python library for a fast and flexible graph data structure.

This project aims to provide developers a convenient library about graph theory algorithm and some basic data structures. It will be developed in Java via Eclipse IDE, supporting both win32 and linux systems, and published as jar files.

CSGraph is a simple graph library. It provides the most popular algorithms to create and manipulate graphs.

GraphSmart is a collection of graph data structures and algorithms utilizing generics and the Microsoft .NET 2.0 Framework. Included items are commonly used in software engineering but not included in the .NET 2.0 Framework class library.

A graph library, developed in Java.

The project ASHWOOD has a goal to create an open source Java implementation of graphs, graph related algorithms, and other useful concepts and algorithms of CS, Applied Mathematics, and their applications.

Provides the implementation of an adjacency-list based graph. Edges and nodes can be decorated with extra (user-provided) information. Depth-first and breadth-first algorithms are also provided. Some of the features are: -create and configure a State Tr

RGL is a framework for graph datastructures and algorithms implemented in Ruby. The main site is now at RubyForge: rgl.rubyforge.org

GraphScript project is a network theory simulator based purely on Java and Java scripting engines. It is intended to allow fast development, testing and visualization of network theory (graph) algorithms.

Path Partitioner constructs random graph partitions and solves the linear (or integer) programming problems that assign weights to the edges such that the performance ratio of the local search algorithm for the Path Partitioning problem is minimized. See http://www.tau.ac.il/~ohadschn/Thesis/Partitioning.pdf. Requirements: Microsoft Automatic Graph Layout http://research.microsoft.com/en-us/projects/msagl/ Gurobi Optimizer http://www.gurobi.com/ Permutations, Combinations, and...