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.

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

Anytime Guaranteed Search with Spanning Trees

A search engine using a simplified version of Google's page rank 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.

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.

Algorithm practice with C++

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

This repository shows all my projects of the Harvards "CS50's Introduction to Artificial Intelligence with Python" course. I completed this course with a CS50 certificate, which can be found here: https://cs50.harvard.edu/certificates/6c2e31dd-097a-4ce7-b603-25579a2049f6

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.

Maze solver designed and implemented for solving 2D mazes using graph search with different strategies

AUT Data Structure Projects

A program that can solve any maze using DFS, BFS or A* search algorithms. Applies Genetic Algorithm to generate difficult yet solvable maze

A small python curses tool to visualize some graph searching algorithms.