Back
bellman-ford (clj)
(source)function
(bellman-ford g start)
Given a weighted, directed graph G = (V, E) with source start,
the Bellman-Ford algorithm produces map of single source shortest
paths and their costs if no negative-weight cycle that is reachable
from the source exists, and false otherwise, indicating that no
solution exists.