graphs.finding_bridges
======================

.. py:module:: graphs.finding_bridges

.. autoapi-nested-parse::

   An edge is a bridge if, after removing it count of connected components in graph will
   be increased by one. Bridges represent vulnerabilities in a connected network and are
   useful for designing reliable networks. For example, in a wired computer network, an
   articulation point indicates the critical computers and a bridge indicates the critical
   wires or connections.

   For more details, refer this article:
   https://www.geeksforgeeks.org/bridge-in-a-graph/



Functions
---------

.. autoapisummary::

   graphs.finding_bridges.__get_demo_graph
   graphs.finding_bridges.compute_bridges


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

.. py:function:: __get_demo_graph(index)

.. py:function:: compute_bridges(graph: dict[int, list[int]]) -> list[tuple[int, int]]

   Return the list of undirected graph bridges [(a1, b1), ..., (ak, bk)]; ai <= bi
   >>> compute_bridges(__get_demo_graph(0))
   [(3, 4), (2, 3), (2, 5)]
   >>> compute_bridges(__get_demo_graph(1))
   [(6, 7), (0, 6), (1, 9), (3, 4), (2, 4), (2, 5)]
   >>> compute_bridges(__get_demo_graph(2))
   [(1, 6), (4, 6), (0, 4)]
   >>> compute_bridges(__get_demo_graph(3))
   []
   >>> compute_bridges({})
   []