.. _f-ruesparis: module ``special.rues_paris`` ============================= Short summary +++++++++++++ module ``ensae_teaching_cs.special.rues_paris`` Code implémentant la première solution proposée à :ref:`Parcourir les rues de Paris `. :githublink:`%|py|6` Functions +++++++++ +------------------------------------------------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------+ | function | truncated documentation | +==========================================================================================+==========================================================================================================================+ | :func:`_delete_edge ` | Removes an edge from the graph. | +------------------------------------------------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------+ | :func:`_explore_path ` | Explores an eulerian path, remove used edges from edges_from. | +------------------------------------------------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------+ | :func:`bellman ` | Implémente l'algorithme de `Bellman-Ford `_. | +------------------------------------------------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------+ | :func:`connected_components ` | Computes the connected components. | +------------------------------------------------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------+ | :func:`distance_haversine ` | Calcule la distance de Haversine `Haversine formula `_ | +------------------------------------------------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------+ | :func:`distance_paris ` | Distance euclidienne approchant la distance de Haversine (uniquement pour Paris). | +------------------------------------------------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------+ | :func:`euler_path ` | Computes an eulerian path. We assume every vertex has an even degree. | +------------------------------------------------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------+ | :func:`eulerien_extension ` | Construit une extension eulérienne d'un graphe. | +------------------------------------------------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------+ | :func:`get_data ` | Retourne les données des rues de Paris. On suppose que les arcs sont uniques et qu'il si :math:`j \rightarrow k` est ... | +------------------------------------------------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------+ | :func:`graph_degree ` | calcul le degré de chaque noeud | +------------------------------------------------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------+ | :func:`kruskal ` | Applique l'algorithme de Kruskal (ou ressemblant) pour choisir les arcs à ajouter. | +------------------------------------------------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------+ | :func:`possible_edges ` | Construit la liste de tous les arcs possibles en filtrant sur la distance à vol d'oiseau. | +------------------------------------------------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------+ Documentation +++++++++++++ .. automodule:: ensae_teaching_cs.special.rues_paris :members: :special-members: __init__ :show-inheritance: