mirror of
https://github.com/TheAlgorithms/Python.git
synced 2025-01-18 16:27:02 +00:00
267b5eff40
* Added doctest and more explanation about Dijkstra execution. * tests were not passing with python2 due to missing __init__.py file at number_theory folder * Removed the dot at the beginning of the imported modules names because 'python3 -m doctest -v data_structures/hashing/*.py' and 'python3 -m doctest -v data_structures/stacks/*.py' were failing not finding hash_table.py and stack.py modules. * Moved global code to main scope and added doctest for project euler problems 1 to 14. * Added test case for negative input. * Changed N variable to do not use end of line scape because in case there is a space after it the script will break making it much more error prone. * Added problems description and doctests to the ones that were missing. Limited line length to 79 and executed python black over all scripts. * Changed the way files are loaded to support pytest call. * Added __init__.py to problems to make them modules and allow pytest execution. * Added project_euler folder to test units execution * Changed 'os.path.split(os.path.realpath(__file__))' to 'os.path.dirname()' |
||
---|---|---|
.. | ||
a_star.py | ||
articulation_points.py | ||
basic_graphs.py | ||
bellman_ford.py | ||
bfs_shortest_path.py | ||
bfs.py | ||
breadth_first_search.py | ||
check_bipartite_graph_bfs.py | ||
check_bipartite_graph_dfs.py | ||
depth_first_search.py | ||
dfs.py | ||
dijkstra_2.py | ||
dijkstra_algorithm.py | ||
dijkstra.py | ||
directed_and_undirected_(weighted)_graph.py | ||
edmonds_karp_multiple_source_and_sink.py | ||
eulerian_path_and_circuit_for_undirected_graph.py | ||
even_tree.py | ||
finding_bridges.py | ||
floyd_warshall.py | ||
graph_list.py | ||
graph_matrix.py | ||
kahns_algorithm_long.py | ||
kahns_algorithm_topo.py | ||
minimum_spanning_tree_kruskal.py | ||
minimum_spanning_tree_prims.py | ||
multi_hueristic_astar.py | ||
page_rank.py | ||
prim.py | ||
scc_kosaraju.py | ||
tarjans_scc.py |