Search Results for "graph algorithm" - Page 3

Primarily this library was developed for producing a set of super-pixels from an image (i.e. an over-segmentation). The segmentation is produced by running multiple instances of Dijkstra's Algorithm from a set of seed points; those nodes which belong to a given Dijkstra cloud form a segment (so the number of segments is fixed and determined at the beginning of the algorithm). The goal is to add code that moves from the over-segmentation to a more useful segmentation. The library includes...

implementation of "GAIA: graph classification using evolutionary computation" in SIGMOD'10. a discriminative subgraph pattern mining algorithm using evolutionary computation implemented by the author

Provide a testbed to play with pagerank-like algorithm on graph. You can easily add vertices, edges, save the graph for reuse, etc. For now, only Pagerank is implemented, but in the future, other algorithms will be added.

The Atlas-Link software implements a greedy algorithm and uses graph theory to link and orient assembled existing contigs quickly and accurately using mate pair information.

Cgraph simulator is a tool to simulate common graph algorithms like bfs,dfs etc specially designed for algorithm learners. For detailed info visit: http://www.shafaetsplanet.com/cgraph/

The E* algorithm is a path planner for (mobile) robotics. Unlike A*, which constrains movements to graph edges, it produces smooth trajectories by interpolating between edges. Like D*, it supports dynamic replanning after local path cost changes.

LSGTL means LLX’s Static Graph Template Library which is a light-weighted header-only template library developed mainly for static graph analysis. LSGTL is expected to be used in laboratories for research purposes mostly.

BorderFlow implements a general-purpose graph clustering algorithm. It maximizes the inner to outer flow ratio from the border of each cluster to the rest of the graph.

Game Toolbox is a C# assembly designed to facilitate the creation of games and game prototypes. It contains no graphics code, does not depend on XNA, and is Mono-compatible. It provides implementations of A*, GOAP, a genetic algorithm, and more.

Program predicts a jam for chosen task on road graph. Data example: http://imat2010.yandex.ru There are 30 days with information about jams since 16:00 till 22:00. Need to predict jams at 31st. Algorithm is based on SVM library. BSD license.

Pure Java implementation of an interactive 3d graph rendering engine and editor using a spring embedder algorithm. Nice looking sterile real time 3d environment. Feel free to extend our project and build something awesome, just let us know please :D

C++ Graph is a port of the Annas.Graph Java Library to C++. Visual components are excluded from this port. Will support Breadth First and Depth First Searches, Djikstra Algorithm for shortest path.

We propose a metabolic pathway drawing algorithm for reducing the number of edge crossings by considering the fact that metabolic pathway graph is scale-free network.

G.A.V. (Graph Algorithm Visualizer) is a tool that visualizes algorithms from graph theory. A step-by-step visualization from each different algorithm allows the user to understand the particular algorithm very easily.

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.

JPowerGraph is a Java library for creating directed graphs for both Swing and SWT. It supports graph movement, selection, context menus, tooltips and dynamic edge creation. JPowerGraph has a spring layout algorithm based on that used in TouchGraph.

Simple Java Graph is a minimal matrix- and listbased graph implementation. An AStar search algorithm is also available.

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.

ksudoku is a fully-featured Sudoku puzzle generator and solver for KDE. With it you can generate and play 3D and 2D puzzles of different sizes and levels. The main algorithm is fast and extendable to any general graph coloring problem.

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

pythag is an algorithm and script for computing primitive Pythagorean triples using the command line. Has an option to output to a file. It also has an option to output to a graph using GLUT, to which it now depends.

A .NET implementation of the Gabow, Kaplan, Tarjan algorithm for testing the uniqueness of a perfect matching in a general graph.

jGABL (the Java Graph Algorithm Base Library) is a java library for the implementation of graph algorithms. It covers a hierarchy of graph concepts, various graph implementations, and algorithm animation.

The implementations of finding the k shortest paths (KSP) algorithm. A C/C++ library including some classical graph relative algorithm implementations.

My program to make possible simulation of algorithm on 3-dimensional graph. We can also to create or load 3-dimensional graph and start differents algorithm. On my home page is available this program as applet. You can run applet if you were using a Java