module special

Short summary

module ensae_teaching_cs.special

Shortcuts to special

Documentation

Shortcuts to special

List of almost reusable algorithms implemented in this module

• tsp_kruskal_algorithm: TSP
• draw_line: Bresenham algorithm (line)
• draw_ellipse: Bresenham algorithm (ellipse)
• distance_haversine: distance of Haversine
• bellman: shortest paths in a graph with Bellman-Ford
• connected_components: computes the connected components
• graph_degree: computes the degree of each node in a graph degree
• resolution_sudoku: solves a sudoku

source on GitHub