NxM puzzle solver using graph traversal algorithms

modern mathematical graph/network library written in PHP

Lab assignments and a final project for course DD2410 "Introduction to Robotics" at KTH University.

Anytime Guaranteed Search with Spanning Trees

Porjects for Algorithmic Techniques for Artificial Intelligence

A search engine using a simplified version of Google's page rank algorithm

Planning algorithms - BFS, DFS, Dijkstra’s, and A* implemented on a grid world environment of configurable obstacle density

Implementation of several algorithms on graphs, such as traversal, finding shortest paths, finding the minimum spanning tree and solving travelling salesman problem.

SkyRoute is a graph search program using depth first search and breadth first search in order to determine the fastest route from a landmark(mapped to closest train station) to another.Please note all the files are annotated making it easier to understand

This project solves a 15 puzzle board from an input file using A star graph search

I compared two graph search algorithms, the breadth-first search algorithm and the A* search algorithm.

FIDDLE (Finding Interactions using Diagram Driven modeL Extension) is a tool to automatically assemble or extend models with the knowledge extracted from published literature. The two main methods developed as part of FIDDLE are called Breadth First Addition (BFA) and Depth First Addition (DFA), and they are based on network search algorithms.

Algorithm practice with C++

AUT Data Structure Projects

Intelligent Search – Motion Planning in a Sokoban Warehouse

Bachelor Thesis - Implementation of LexDFS algorithm on chordal graphs

A Java implementation of Graph Search with heuristics for N-Puzzle problem