Search Results for "graph algorithms" - Page 8

The purpose of this project is to create a graph (network) library for the python language. The library will provide functions to manipulate graph structures, as well as a number of graph algorithms like Breadth & Depth First Search, Dijkstra's

The "Framework for Implicit Graph Algorithms and Representations by OBDDs" (Figaro) automatically manages experiments with input generator and algorithm plugins. It already contains some generators and algorithms for graph and scheduling problems.

A Java software for 3D visualization of graphs/networks. It implements many graph layout algorithms (such as force-directed methods), graph generators (such as scale-free networks) and graph modifiers. Most functions can be accessed through its GUI.

DBIntrospector is a collection of Perl modules, extensions, and applications that generalize db metadata. These contain graph traversal algorithms and rendering visitors that can be applied to any database for which there exists a DB::Introspector driver.

boost_graph tried to wrap the C++ Boost Graph library in Python, providing graph algorithms like Breadth First Search, DFS, Shortest Path, Topological sort. This project is dead (http://bayleshanks.com/pamv1)

Not yet playable. jadab is a Dots and Boxes playing program. It uses modern algorithms and graph theory to play the twin game, Strings and Coins. It is being done as a research project in math, game theory, and computer science at Dalhousie University

Suvi is a Java-library for graph visualization and a framework for developing graph visualization algorithms.

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

A graph layout optimizer based on the iterative application of laws of physics instead of using finite-pass algorithms.

Package for general implementation of graphs in Python. Provides generic data structures, graph operators, and common algorithms.

A Scene-Graph-API based on Aura (see http://aura.sourceforge.net). We are programming in C++ and will support Linux and Win32-Platforms. Scenes which are in 3DS-format can be imported. Other modifications include gameprogramming-algorithms.

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.

JGraphica is a graphical platform for developing oriented and not-oriented graph algorithms. The platform allows the creation and management of graphs, eliminating the burden of creating some custom solutions for graph editing.

The Graph Theory Tool is a simple GUI tool to demonstrate the basics of graph theory in discrete mathematics. It allows you to draw your own graph, connect the points and play with several algorithms, including Dijkstra, Prim, Fleury

A Web based IDE that supports nodes and edges (graphs) with attributes. An interpretor executes your graphs. Views of graphs allow developers to see references to variables, easily see the path of execution and rearrange the structure of data and program

Two Markov-Chain-Monte-Carlo-algorithms ("Glauber Dynamics" and "Flip Dynamics") used for randomly sampling k-colorings of a graph.

Ged(Pluginable Graph Editor) is modern visual Graph Editor, written on java, with pluginable interface for different algorithms on graph's and different graph's formats.

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...

This project is an exercise and proof of concept. It aims to minimize the tree width of the tree decompositioned graph G with the methods of genetic algorithms.

RectaGraphTrace aims to assist in step-by-step visualization of graph search algorithms by displaying graphs and automating the creation and correction of graph traces such as those that a student would produce while manually executing a search.