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#
draw_ellipse
: Bresenham algorithm (ellipse)distance_haversine
: distance of Haversinebellman
: shortest paths in a graph with Bellman-Fordconnected_components
: computes the connected componentsgraph_degree
: computes the degree of each node in a graph degreeresolution_sudoku
: solves a sudoku