algorithms\.graphs
==================

.. automodule:: algorithms.graphs
    :members:
    :undoc-members:
    :show-inheritance:

BFS
~~~
.. automodule:: algorithms.graphs.bfs
    :members:
    :undoc-members:
    :show-inheritance:

DFS
~~~
.. automodule:: algorithms.graphs.bfs
    :members:
    :undoc-members:
    :show-inheritance:


Dijkstra
~~~~~~~~
.. automodule:: algorithms.graphs.dijkstra
    :members:
    :undoc-members:
    :show-inheritance:


Bidirectional Dijkstra
~~~~~~~~~~~~~~~~~~~~~~
.. automodule:: algorithms.graphs.bidi_dijkstra
    :members:
    :undoc-members:
    :show-inheritance:


Cycle detection (DFS)
~~~~~~~~~~~~~~~~~~~~~
.. automodule:: algorithms.graphs.acyclicity_check
    :members:
    :undoc-members:
    :show-inheritance:


AStar
~~~~~
.. automodule:: algorithms.graphs.AStar
    :members:
    :undoc-members:
    :show-inheritance:

Bellman-Ford (shortest path with negative arbitrage)
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
.. automodule:: algorithms.graphs.Belman_Ford_shortest_paths_algorithm_with_negative_arbitrage
    :members:
    :undoc-members:
    :show-inheritance:

Kruskal
~~~~~~~
.. automodule:: algorithms.graphs.Kruskal_connecting_points
    :members:
    :undoc-members:
    :show-inheritance:


Bellman-Ford (with negative cycle detection)
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
.. automodule:: algorithms.graphs.bellman_ford_negative_cycle
    :members:
    :undoc-members:
    :show-inheritance:


Bipartite
~~~~~~~~~
.. automodule:: algorithms.graphs.bipartite
    :members:
    :undoc-members:
    :show-inheritance:

BST check
~~~~~~~~~
.. automodule:: algorithms.graphs.bst_check
    :members:
    :undoc-members:
    :show-inheritance:


Strongly connected components
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
.. automodule:: algorithms.graphs.strongly_connected
    :members:
    :undoc-members:
    :show-inheritance:

Topological sort
~~~~~~~~~~~~~~~~
.. automodule:: algorithms.graphs.topological_sort
    :members:
    :undoc-members:
    :show-inheritance: