dfs-search
Here are 134 public repositories matching this topic...
This is the collection of solutions to some computer problems, mainly leetcode
-
Updated
Aug 19, 2022 - Go
Automatic maze generator (DFS) and maze solver (A*, DFS, BFS) in python.
-
Updated
Sep 28, 2021 - Python
Eight Puzzle solver using BFS, DFS & A* search algorithms
-
Updated
May 8, 2020 - Java
Simulation of swarm of robots used to explore and search for a target, done using Webots software.
-
Updated
Oct 30, 2021 - Python
A program to solve a maze using Breadth First Search (BFS) and Depth First Search (DFS).
-
Updated
Jul 13, 2021 - Python
Sliding Puzzle solver and utilities
-
Updated
Jan 21, 2024 - Python
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.
-
Updated
Sep 18, 2023 - Python
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.
-
Updated
Jan 9, 2023 - Python
Principles Of AI Lab Exercises
-
Updated
Jan 13, 2024 - Python
classical search algorithms are used in AI | AI course - Fall 2018
-
Updated
Dec 31, 2018 - Java
A collection of some of the most frequently used Algorithms in C++ and Python
-
Updated
Sep 27, 2021 - Python
8 puzzle solver using BFS, DFS and A star
-
Updated
Nov 14, 2020 - Python
Path Finding Visualizer 🏁
-
Updated
Jun 2, 2020 - Java
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 followe…
-
Updated
Jul 19, 2021 - Python
CIT-316 (Artificial Intelligence Sessional)
-
Updated
Feb 14, 2023 - Jupyter Notebook
Implementation of various algorithms
-
Updated
Jul 26, 2022 - C++
Breadth First Search and Depth First Search implementation in python.
-
Updated
Jan 9, 2023 - Python
Two rival teams of intelligent virtual agents with different abilities compete to gather specific resources from their shared environment. Implemented in Godot, the simulation utilizes A* algorithm, DFS, and genetic algorithms. The team that collects the resources first wins the game.
-
Updated
Jun 12, 2024 - GDScript
Depth First Search and Breadth First Search Implementation in Python
-
Updated
Mar 3, 2022 - Jupyter Notebook
Improve this page
Add a description, image, and links to the dfs-search topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the dfs-search topic, visit your repo's landing page and select "manage topics."