Prolog-Based-Graph-Traversal-BFS-Implementation

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.

JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SreecharanV%2FProlog-Based-Graph-Traversal-BFS-Implementation

Stars: 0
Forks: 0
Open issues: 0

License: None
Language: Prolog
Size: 60.5 KB
Dependencies parsed at: Pending

Created at: 12 months ago
Updated at: 12 months ago
Pushed at: 12 months ago
Last synced at: about 2 months ago

Topics: bfs-algorithm, bfs-search, graphtraversal, prolog, prolog-programming-language

ecosyste.ms

Data

Tools

Indexes

Applications

Experiments

Repos

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