bfs-search

AI maze solving agent to find the shortest path using searching algorithms

Path Finding Visualizer 🏁

A program to solve a maze using Breadth First Search (BFS) and Depth First Search (DFS).

8 puzzle solver using BFS, DFS and A star

classical search algorithms are used in AI | AI course - Fall 2018

Visualizer for various Path Finding Algorithms

Breadth-first search (BFS) is an algorithm for searching a tree data structure that searches the tree one depth at a time. It will explore all nodes at depth 1 then depth 2 and so on. Depth-first search (DFS) is an algorithm for searching a tree data structure that searches the tree vertically. It will explore one branch to the root node followed by the next branch.

Pacman Resolver

This is an R program that takes an activity table whether it is a CPM or a PERT and and proccess it to find the critical path (along with some other calculations in the PERT method )

A visualization tool for pathfinding and maze generation algoritms

Go package providing breadth-first search functions for arbitrary structs

分别基于BFS，Uniform-Cost，A*算法的3D路径检索

Explore a map to find an optimal path from start to goal using classical search-based methods

solve 8-puzzle with BFS Search

Graphs are used in Google maps,Facebook friends, friends of friends, Pipeline connection, electricity connections, shortest path etc.Also providing LAN connections between nodes and in VPN too.Specially spanning tree is used in these networks. visit it: https://image1.slideserve.com/2884352/ch-15-graph-theory-some-practical-uses-n.jpg visit it: https://image.slidesharecdn.com/distructweek15graphstheoryupdated-160227143444/95/distruct-week-15-graphs-theory-updated-2-638.jpg?cb=1456583743 visit it: http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.800.2735&rep=rep1&type=pdf read the 3rd page of this article

Eight Puzzle solver using BFS, DFS & A* search algorithms

Solving missionary cannibal problem using different search strategies in C

Project 0 for the Introduction to "Artificial Intelligence with Python" Harvard online course. App that finds a connection between two actors bases on the movies they have starred in, using BFS algorithm.

My first project in C language

This will help in visualizing different path-finding algorithms.

Robot Navigation using graph algorithms like DFS, BFS Astar etc.

A minimal python program that can give you the solution to the desired goal state from an initial state in a numbered 2*2 Puzzle game.

balance strategy for a k-server problem

path-finding project

graph search algorithms depicted on a nxn matrix graph

use A*, IDS and BFS to sort colored cards in ascending order.

Homeworks done in course CS 599: Algorithms - Design, Analysis, and Implementations at Oregon State University

A variation on the classic water jugs problem implemented using AI approach - heuristic and search algorithms like BFS, DFS, A-star programmed in python.