bfs-search

Here are 3 public repositories matching this topic...

jElhamm / 100-Projects-for-Prolog

"The repository '100 Mini Projects for Prolog' includes small projects for learning and practicing Prolog."

graph prolog prolog-implementation sorting-algorithms sorting-algorithms-implemented dfs-algorithm string-algorithms prolog-programming-language mathematical-programming prolog-rules bfs-search list-operation dls-algorithm list-operations graph-path-finder ids-algorithm

Updated Jul 19, 2024
Prolog

SreecharanV / Prolog-Based-Graph-Traversal-BFS-Implementation

Star

An implementation of graph traversal algorithms in Prolog, focusing on breadth-first search (BFS). The project finds the shortest path between nodes in a graph, covering both directed and undirected graphs with extensive test cases.

prolog prolog-programming-language bfs-algorithm bfs-search graphtraversal

Updated Jun 1, 2024
Prolog

DuaA-A / drone-delivery-pathfinding

Star

Optimal Delivery Coverage via Uninformed/Informed Search in Grid Environments

prolog grid-search bfs-search dfs-search

Updated May 8, 2025
Prolog

Improve this page

Add a description, image, and links to the bfs-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 bfs-search topic, visit your repo's landing page and select "manage topics."

Learn more

Provide feedback

Saved searches

Use saved searches to filter your results more quickly