# `Graph.Pathfindings.BellmanFord`

The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single
source vertex to all of the other vertices in a weighted digraph.
It is capable of handling graphs in which some of the edge weights are negative numbers
Time complexity: O(VLogV)

# `call`

```elixir
@spec call(Graph.t(), Graph.vertex()) ::
  %{required(Graph.vertex()) => integer() | :infinity} | nil
```

Returns nil when graph has negative cycle.

# `call`

---

*Consult [api-reference.md](api-reference.md) for complete listing*