Search Results for "graph isomorphism algorithm"

...It contains a player (Pregor) controlled by the user and an NPC (Dorban) controlled by the Svarog interpreter. The objective is to kill the vampire. Or at least to attack him with the optimal chances. The Svarog AI library contains a new optimization algorithm based on so called hidden variables. In order to achieve the objective Dorban will try to convince Pregor to accompany him, and together they will try to find the vampire in a graph with 5 city nodes. When accompanying Dorban use menu item "follow orders" to follow his orders.

Graph level memory allocation optimization and buffer reuse are supported. The core library tries to keep minimum external dependencies to keep the library footprint small.

This project aims to develop and share fast frequent subgraph mining and graph learning algorithms. Currently we release the frequent subgraph mining package FFSM and later we will include new functions for graph regression and classification package

The MaxParser is written in c++ and can parse with first, second, third and fourth order projective Graph-based Dependency parsing algorithm. The project is the new version of the project "Max-MSTParser". If you want to use this software for research, please reference this web address in your papers

BIL++ is a set of standalone C++ packages for data processing in Bioinformatics (Graph mining, Bayesian networks, Genetic algorithm, Discretization, Gene expression data analysis, Hypothesis testing).

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.