[go: up one dir, main page]

Skip to content
#

dfs-search

Here are 143 public repositories matching this topic...

The-Maze-Game

🏰 The Maze Game offers straightforward maze navigation challenges, built with Prim & DFS Algorithms. Featuring responsive design for easy play on any device, including mobile, with intuitive on-screen controls for movement, it's ideal for quick gaming sessions, providing both casual and challenging experiences!

  • Updated Nov 17, 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

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

Improve this page

Add a description, image, and links to the dfs-search topic page so that developers can more easily learn about it.

Curate this topic

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."

Learn more