graphs.bellman_ford
===================

.. py:module:: graphs.bellman_ford


Attributes
----------

.. autoapisummary::

   graphs.bellman_ford.V


Functions
---------

.. autoapisummary::

   graphs.bellman_ford.bellman_ford
   graphs.bellman_ford.check_negative_cycle
   graphs.bellman_ford.print_distance


Module Contents
---------------

.. py:function:: bellman_ford(graph: list[dict[str, int]], vertex_count: int, edge_count: int, src: int) -> list[float]

   Returns shortest paths from a vertex src to all
   other vertices.
   >>> edges = [(2, 1, -10), (3, 2, 3), (0, 3, 5), (0, 1, 4)]
   >>> g = [{"src": s, "dst": d, "weight": w} for s, d, w in edges]
   >>> bellman_ford(g, 4, 4, 0)
   [0.0, -2.0, 8.0, 5.0]
   >>> g = [{"src": s, "dst": d, "weight": w} for s, d, w in edges + [(1, 3, 5)]]
   >>> bellman_ford(g, 4, 5, 0)
   Traceback (most recent call last):
    ...
   Exception: Negative cycle found


.. py:function:: check_negative_cycle(graph: list[dict[str, int]], distance: list[float], edge_count: int)

.. py:function:: print_distance(distance: list[float], src)

.. py:data:: V