# Coverage for src/ensae_teaching_cs/special/__init__.py: 100%

## 4 statements

, created at 2023-01-27 05:44 +0100

1"""

2@file

3@brief Shortcuts to special

5.. _l-almost_reusable:

7List of almost reusable algorithms implemented in this module

8+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

10* @see fn tsp_kruskal_algorithm: `TSP <https://en.wikipedia.org/wiki/Travelling_salesman_problem>`_

11* @see fn draw_line: `Bresenham <https://en.wikipedia.org/wiki/Bresenham%27s_line_algorithm>`_ algorithm (line)

12* @see fn draw_ellipse: `Bresenham <https://en.wikipedia.org/wiki/Bresenham%27s_line_algorithm>`_ algorithm (ellipse)

13* @see fn distance_haversine: distance of `Haversine <https://en.wikipedia.org/wiki/Haversine_formula>`_

14* @see fn bellman: shortest paths in a graph with `Bellman-Ford <http://fr.wikipedia.org/wiki/Algorithme_de_Bellman-Ford>`_

15* @see fn connected_components: computes the `connected components <https://en.wikipedia.org/wiki/Connected_component_(graph_theory)>`_

16* @see fn graph_degree: computes the degree of each node in a graph `degree <https://en.wikipedia.org/wiki/Degree_(graph_theory)>`_

17* @see fn resolution_sudoku: solves a `sudoku <https://fr.wikipedia.org/wiki/Sudoku>`_

18"""

20from .rues_paris import distance_haversine, bellman, connected_components, graph_degree

21from .sudoku import sudoku2str, resolution_sudoku

22from .tsp_bresenham import draw_line, draw_ellipse

23from .tsp_kruskal import tsp_kruskal_algorithm