From 9a44eb44798900e5d9b8a307a78ab8057f9e3b92 Mon Sep 17 00:00:00 2001 From: Reshad Hasan Date: Mon, 25 Feb 2019 15:35:24 +0600 Subject: [PATCH] Organize graph algorithms (#719) * organized graph algorithms * all graph algorithms in Graphs/ folder * all graph algorithms are in one folder * Rename number theory/factorial_python.py to maths/factorial_python.py --- {graphs => Graphs}/Directed and Undirected (Weighted) Graph.py | 0 {graphs => Graphs}/a_star.py | 0 {graphs => Graphs}/articulation_points.py | 0 {graphs => Graphs}/basic_graphs.py | 0 {data_structures/graph => Graphs}/bellman_ford.py | 0 {data_structures/graph => Graphs}/breadth_first_search.py | 0 {graphs => Graphs}/check_bipartite_graph_bfs.py | 0 {data_structures/graph => Graphs}/depth_first_search.py | 0 {graphs => Graphs}/dijkstra.py | 0 data_structures/graph/dijkstra.py => Graphs/dijkstra_2.py | 0 {data_structures/graph => Graphs}/dijkstra_algorithm.py | 0 {data_structures/graph => Graphs}/even_tree.py | 0 {graphs => Graphs}/finding_bridges.py | 0 {data_structures/graph => Graphs}/floyd_warshall.py | 0 {data_structures/graph => Graphs}/graph.py | 0 {data_structures/graph => Graphs}/graph_list.py | 0 {data_structures/graph => Graphs}/graph_matrix.py | 0 {graphs => Graphs}/kahns_algorithm_long.py | 0 {graphs => Graphs}/kahns_algorithm_topo.py | 0 {graphs => Graphs}/minimum_spanning_tree_kruskal.py | 0 {graphs => Graphs}/minimum_spanning_tree_prims.py | 0 {graphs => Graphs}/multi_hueristic_astar.py | 0 {graphs => Graphs}/scc_kosaraju.py | 0 {graphs => Graphs}/tarjans_scc.py | 0 factorial_python.py => maths/factorial_python.py | 0 25 files changed, 0 insertions(+), 0 deletions(-) rename {graphs => Graphs}/Directed and Undirected (Weighted) Graph.py (100%) rename {graphs => Graphs}/a_star.py (100%) rename {graphs => Graphs}/articulation_points.py (100%) rename {graphs => Graphs}/basic_graphs.py (100%) rename {data_structures/graph => Graphs}/bellman_ford.py (100%) rename {data_structures/graph => Graphs}/breadth_first_search.py (100%) rename {graphs => Graphs}/check_bipartite_graph_bfs.py (100%) rename {data_structures/graph => Graphs}/depth_first_search.py (100%) rename {graphs => Graphs}/dijkstra.py (100%) rename data_structures/graph/dijkstra.py => Graphs/dijkstra_2.py (100%) rename {data_structures/graph => Graphs}/dijkstra_algorithm.py (100%) rename {data_structures/graph => Graphs}/even_tree.py (100%) rename {graphs => Graphs}/finding_bridges.py (100%) rename {data_structures/graph => Graphs}/floyd_warshall.py (100%) rename {data_structures/graph => Graphs}/graph.py (100%) rename {data_structures/graph => Graphs}/graph_list.py (100%) rename {data_structures/graph => Graphs}/graph_matrix.py (100%) rename {graphs => Graphs}/kahns_algorithm_long.py (100%) rename {graphs => Graphs}/kahns_algorithm_topo.py (100%) rename {graphs => Graphs}/minimum_spanning_tree_kruskal.py (100%) rename {graphs => Graphs}/minimum_spanning_tree_prims.py (100%) rename {graphs => Graphs}/multi_hueristic_astar.py (100%) rename {graphs => Graphs}/scc_kosaraju.py (100%) rename {graphs => Graphs}/tarjans_scc.py (100%) rename factorial_python.py => maths/factorial_python.py (100%) diff --git a/graphs/Directed and Undirected (Weighted) Graph.py b/Graphs/Directed and Undirected (Weighted) Graph.py similarity index 100% rename from graphs/Directed and Undirected (Weighted) Graph.py rename to Graphs/Directed and Undirected (Weighted) Graph.py diff --git a/graphs/a_star.py b/Graphs/a_star.py similarity index 100% rename from graphs/a_star.py rename to Graphs/a_star.py diff --git a/graphs/articulation_points.py b/Graphs/articulation_points.py similarity index 100% rename from graphs/articulation_points.py rename to Graphs/articulation_points.py diff --git a/graphs/basic_graphs.py b/Graphs/basic_graphs.py similarity index 100% rename from graphs/basic_graphs.py rename to Graphs/basic_graphs.py diff --git a/data_structures/graph/bellman_ford.py b/Graphs/bellman_ford.py similarity index 100% rename from data_structures/graph/bellman_ford.py rename to Graphs/bellman_ford.py diff --git a/data_structures/graph/breadth_first_search.py b/Graphs/breadth_first_search.py similarity index 100% rename from data_structures/graph/breadth_first_search.py rename to Graphs/breadth_first_search.py diff --git a/graphs/check_bipartite_graph_bfs.py b/Graphs/check_bipartite_graph_bfs.py similarity index 100% rename from graphs/check_bipartite_graph_bfs.py rename to Graphs/check_bipartite_graph_bfs.py diff --git a/data_structures/graph/depth_first_search.py b/Graphs/depth_first_search.py similarity index 100% rename from data_structures/graph/depth_first_search.py rename to Graphs/depth_first_search.py diff --git a/graphs/dijkstra.py b/Graphs/dijkstra.py similarity index 100% rename from graphs/dijkstra.py rename to Graphs/dijkstra.py diff --git a/data_structures/graph/dijkstra.py b/Graphs/dijkstra_2.py similarity index 100% rename from data_structures/graph/dijkstra.py rename to Graphs/dijkstra_2.py diff --git a/data_structures/graph/dijkstra_algorithm.py b/Graphs/dijkstra_algorithm.py similarity index 100% rename from data_structures/graph/dijkstra_algorithm.py rename to Graphs/dijkstra_algorithm.py diff --git a/data_structures/graph/even_tree.py b/Graphs/even_tree.py similarity index 100% rename from data_structures/graph/even_tree.py rename to Graphs/even_tree.py diff --git a/graphs/finding_bridges.py b/Graphs/finding_bridges.py similarity index 100% rename from graphs/finding_bridges.py rename to Graphs/finding_bridges.py diff --git a/data_structures/graph/floyd_warshall.py b/Graphs/floyd_warshall.py similarity index 100% rename from data_structures/graph/floyd_warshall.py rename to Graphs/floyd_warshall.py diff --git a/data_structures/graph/graph.py b/Graphs/graph.py similarity index 100% rename from data_structures/graph/graph.py rename to Graphs/graph.py diff --git a/data_structures/graph/graph_list.py b/Graphs/graph_list.py similarity index 100% rename from data_structures/graph/graph_list.py rename to Graphs/graph_list.py diff --git a/data_structures/graph/graph_matrix.py b/Graphs/graph_matrix.py similarity index 100% rename from data_structures/graph/graph_matrix.py rename to Graphs/graph_matrix.py diff --git a/graphs/kahns_algorithm_long.py b/Graphs/kahns_algorithm_long.py similarity index 100% rename from graphs/kahns_algorithm_long.py rename to Graphs/kahns_algorithm_long.py diff --git a/graphs/kahns_algorithm_topo.py b/Graphs/kahns_algorithm_topo.py similarity index 100% rename from graphs/kahns_algorithm_topo.py rename to Graphs/kahns_algorithm_topo.py diff --git a/graphs/minimum_spanning_tree_kruskal.py b/Graphs/minimum_spanning_tree_kruskal.py similarity index 100% rename from graphs/minimum_spanning_tree_kruskal.py rename to Graphs/minimum_spanning_tree_kruskal.py diff --git a/graphs/minimum_spanning_tree_prims.py b/Graphs/minimum_spanning_tree_prims.py similarity index 100% rename from graphs/minimum_spanning_tree_prims.py rename to Graphs/minimum_spanning_tree_prims.py diff --git a/graphs/multi_hueristic_astar.py b/Graphs/multi_hueristic_astar.py similarity index 100% rename from graphs/multi_hueristic_astar.py rename to Graphs/multi_hueristic_astar.py diff --git a/graphs/scc_kosaraju.py b/Graphs/scc_kosaraju.py similarity index 100% rename from graphs/scc_kosaraju.py rename to Graphs/scc_kosaraju.py diff --git a/graphs/tarjans_scc.py b/Graphs/tarjans_scc.py similarity index 100% rename from graphs/tarjans_scc.py rename to Graphs/tarjans_scc.py diff --git a/factorial_python.py b/maths/factorial_python.py similarity index 100% rename from factorial_python.py rename to maths/factorial_python.py