There are 1 repository under dfs-search topic.
Automatic maze generator (DFS) and maze solver (A*, DFS, BFS) in python.
Eight Puzzle solver using BFS, DFS & A* search algorithms
Simulation of swarm of robots used to explore and search for a target, done using Webots software.
A program to solve a maze using Breadth First Search (BFS) and Depth First Search (DFS).
Sliding Puzzle solver and utilities
PySiteCrawler is a Python library for web crawling and data extraction. It's designed for exploring web pages, extracting text, and managing links efficiently. You can easily store scraped data in .txt files for analysis. Future updates will add more traversal strategies.
This is a variation of the classical river crossing puzzle. In these kinds of puzzles, the limitations to the solution is defined by the constraints placed on the different objects involved.
Principles Of AI Lab Exercises
classical search algorithms are used in AI | AI course - Fall 2018
A collection of some of the most frequently used Algorithms in C++ and Python
Path Finding Visualizer :checkered_flag:
Breadth First Search and Depth First Search implementation in python.
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.
Implementation of various algorithms
CIT-316 (Artificial Intelligence Sessional)
This will help in visualizing different path-finding algorithms.
While studying for an exam, I made these two small projects that show animation of both DFS(Depth-First-Search) and BFS(Breadth-First-Search. After the exam, I have decided to merge these two projects and annotate them so others can study off what I made for myself.)
Robot that cleans room from dirts. Finds the optimum path eventually. Same algorithms are applied as in finding path to escape a maze.
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.
Different Operation on Binary Tree Structure
Logic puzzle that deals with people, a bridge and a torch, with some constraints
:ghost: :video_game: This is my implementation in the famous Berkeley pacman artificial intelligence project: http://ai.berkeley.edu/project_overview.html.
8 puzzle solver using: BFS, DFS, A* (Manhattan, Euclidean)
Depth First Search and Breadth First Search Implementation in Python
Smart Vacuum Cleaner Agent
Designed to crack the Traveling Salesman Problem, this program employs graph theory, depth-first search, and a stack for efficient route optimization. Tailored for budget-conscious users navigating city routes, it guarantees an optimal journey starting and concluding in Santa Cruz, with each city visited precisely once.
Practicals from sem 5 of bsc IT,Third year
A contact Manager Using Advance Data Structure Trie and Searching algorithm DFS/BFS