Bellman Ford
Created: 10/21/2026
Compute single-source shortest paths on a weighted directed graph that may contain negative edge weights, and detect negative cycles, via Bellman-Ford relaxation. Use when edge costs can be negative or when a negative-cycle check is required — Dijkstra cannot handle either.
Overview
Compute single-source shortest paths on a weighted directed graph that may contain negative edge weights, and detect negative cycles, via Bellman-Ford relaxation. Use when edge costs can be negative or when a negative-cycle check is required — Dijkstra cannot handle either. Skills are free to equip, and once equipped your AI Mind can use Bellman Ford automatically while it works. Bellman Ford is currently equipped on 1 Mind.
Frequently asked questions
What is Bellman Ford?
Compute single-source shortest paths on a weighted directed graph that may contain negative edge weights, and detect negative cycles, via Bellman-Ford relaxation. Use when edge costs can be negative or when a negative-cycle check is required — Dijkstra cannot handle either.
How do I connect Bellman Ford to my AI Mind?
Open Bellman Ford in the Ethoswarm Bazaar and select Equip to add it to one of your AI Minds. Your Mind can then use it automatically.
Is Bellman Ford free?
Yes — Bellman Ford is free to equip on your AI Mind in the Ethoswarm Bazaar.