GitHub / SamAddy / Breadth-First-Search-Algorithm
Breadth-first search (BFS) is an algorithm for traversing or searching a graph or tree data structure. It starts at the root node and explores all the nodes at the current level before moving on to the next level.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SamAddy%2FBreadth-First-Search-Algorithm
PURL: pkg:github/SamAddy/Breadth-First-Search-Algorithm
Stars: 1
Forks: 0
Open issues: 0
License: None
Language: Python
Size: 3.91 KB
Dependencies parsed at: Pending
Created at: over 2 years ago
Updated at: over 2 years ago
Pushed at: over 2 years ago
Last synced at: about 2 years ago
Topics: algorithm, bfs-algorithm, maze, pathfinding