Solution in Prolog to the SSSP problem through Dijkstra's algoritm. This library also provide an efficient implementation of both a direct, weighted graph and a priority queue (MIN-HEAP).
graph prolog priority-queue logic-programming dijkstra-algorithm dijkstra-shortest-path shortest-path-algorithm sssp min-
-
Updated
Mar 2, 2026 - Prolog