Update DIRECTORY.md

Author: jaspalsb

DIRECTORY.md

@@ -78,3 +78,118 @@
 ## Dynamic Programming
 * [Bitmask](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/bitmask.py)
 * [Coin Change](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/coin_change.py)
+* [Edit Distance](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/edit_distance.py)
+* [Fast Fibonacci](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/fast_fibonacci.py)
+* [Fibonacci](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/fibonacci.py)
+* [Floyd Warshall](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/floyd_warshall.py)
+* [Integer Partition](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/integer_partition.py)
+* [K Means Clustering Tensorflow](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/k_means_clustering_tensorflow.py)
+* [Knapsack](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/knapsack.py)
+* [Longest Common Subsequence](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/longest_common_subsequence.py)
+* [Longest Increasing Subsequence](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/longest_increasing_subsequence.py)
+* [Longest Increasing Subsequence Nlogn](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/longest_increasing_subsequence_O(nlogn).py)
+* [Longest Sub Array](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/longest_sub_array.py)
+* [Matrix Chain Order](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/matrix_chain_order.py)
+* [Max Sub Array](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/max_sub_array.py)
+* [Minimum Partition](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/minimum_partition.py)
+* [Rod Cutting](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/rod_cutting.py)
+* [Subset Generation](https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/subset_generation.py)
+## File Transfer Protocol
+* [FTP Client Server](https://github.com/TheAlgorithms/Python/blob/master/file_transfer_protocol/ftp_client_server.py)
+* [FTP Send Receive](https://github.com/TheAlgorithms/Python/blob/master/file_transfer_protocol/ftp_send_receive.py)
+## Graphs
+* [BFS](https://github.com/TheAlgorithms/Python/blob/master/graphs/BFS.py)
+* [DFS](https://github.com/TheAlgorithms/Python/blob/master/graphs/DFS.py)
+* [Directed and Undirected Weighted Graph](https://github.com/TheAlgorithms/Python/blob/master/graphs/Directed_and_Undirected_(Weighted)_Graph.py)
+* [Eulerian Path and Circuit for Undirected Graph](https://github.com/TheAlgorithms/Python/blob/master/graphs/Eulerian_path_and_circuit_for_undirected_graph.py)
+* [A Star](https://github.com/TheAlgorithms/Python/blob/master/graphs/a_star.py)
+* [Articulatioin Points](https://github.com/TheAlgorithms/Python/blob/master/graphs/articulation_points.py)
+* [Basic Graph](https://github.com/TheAlgorithms/Python/blob/master/graphs/basic_graphs.py)
+* [Bellman Ford](https://github.com/TheAlgorithms/Python/blob/master/graphs/bellman_ford.py)
+* [BFS Shortest Path](https://github.com/TheAlgorithms/Python/blob/master/graphs/bfs_shortest_path.py)
+* [Breadth First Search](https://github.com/TheAlgorithms/Python/blob/master/graphs/breadth_first_search.py)
+* [Check Bipartite Graph BFS](https://github.com/TheAlgorithms/Python/blob/master/graphs/check_bipartite_graph_bfs.py)
+* [Check Bipartite Graph DFS](https://github.com/TheAlgorithms/Python/blob/master/graphs/check_bipartite_graph_dfs.py)
+* [Depth First Search](https://github.com/TheAlgorithms/Python/blob/master/graphs/depth_first_search.py)
+* [Dijkstra](https://github.com/TheAlgorithms/Python/blob/master/graphs/dijkstra.py)
+* [Dijkstra 2](https://github.com/TheAlgorithms/Python/blob/master/graphs/dijkstra_2.py)
+* [Dijkstra Algorithm](https://github.com/TheAlgorithms/Python/blob/master/graphs/dijkstra_algorithm.py)
+* [Edmonds Karp Multiple Source and Sink](https://github.com/TheAlgorithms/Python/blob/master/graphs/edmonds_karp_multiple_source_and_sink.py)
+* [Even Tree](https://github.com/TheAlgorithms/Python/blob/master/graphs/even_tree.py)
+* [Finding Bridges](https://github.com/TheAlgorithms/Python/blob/master/graphs/finding_bridges.py)
+* [Floyd Warshall](https://github.com/TheAlgorithms/Python/blob/master/graphs/floyd_warshall.py)
+* [Graph List](https://github.com/TheAlgorithms/Python/blob/master/graphs/graph_list.py)
+* [Graph Matrix](https://github.com/TheAlgorithms/Python/blob/master/graphs/graph_matrix.py)
+* [Kahns Algorithm Long](https://github.com/TheAlgorithms/Python/blob/master/graphs/kahns_algorithm_long.py)
+* [Kahns Algorithm Topo](https://github.com/TheAlgorithms/Python/blob/master/graphs/kahns_algorithm_topo.py)
+* [Minimum Spanning Tree Kruskal](https://github.com/TheAlgorithms/Python/blob/master/graphs/minimum_spanning_tree_kruskal.py)
+* [Minimum Spanning Tree Prims](https://github.com/TheAlgorithms/Python/blob/master/graphs/minimum_spanning_tree_prims.py)
+* [Multi Hueristic Astar](https://github.com/TheAlgorithms/Python/blob/master/graphs/multi_hueristic_astar.py)
+* [Page Rank](https://github.com/TheAlgorithms/Python/blob/master/graphs/page_rank.py)
+* [Prim](https://github.com/TheAlgorithms/Python/blob/master/graphs/prim.py)
+* [Scc Kosaraju](https://github.com/TheAlgorithms/Python/blob/master/graphs/scc_kosaraju.py)
+* [Tarjans Scc](https://github.com/TheAlgorithms/Python/blob/master/graphs/tarjans_scc.py)
+## Hashes
+* [Chaos Machine](https://github.com/TheAlgorithms/Python/blob/master/hashes/chaos_machine.py)
+* [Md5](https://github.com/TheAlgorithms/Python/blob/master/hashes/md5.py)
+* [Sha1](https://github.com/TheAlgorithms/Python/blob/master/hashes/sha1.py)
+## Linear Algebra Python
+* [Source](https://github.com/TheAlgorithms/Python/tree/master/linear_algebra_python)
+## Machine Learning
+* Random Forest Classification
+  * [Random Forest Classifier](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/Random%20Forest%20Classification/Random%20Forest%20Classifier.ipynb)
+  * [Social Network ADS](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/Random%20Forest%20Classification/Social_Network_Ads.csv)
+  * [Random Forest Classification](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/Random%20Forest%20Classification/random_forest_classification.py)
+* Random Forest Regression
+  * [Position Salaries](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/Random%20Forest%20Regression/Position_Salaries.csv)
+  * [Random Forest Regression](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/Random%20Forest%20Regression/Random%20Forest%20Regression.ipynb)
+  * [Random Forest Regression 2](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/Random%20Forest%20Regression/random_forest_regression.py)
+* [Naive Bayes](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/NaiveBayes.ipynb)
+* [Decision Tree](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/decision_tree.py)
+* [Gradient Descent](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/gradient_descent.py)
+* [K Means Clust](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/k_means_clust.py)
+* [Linear Regression](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/linear_regression.py)
+* [Logistics Regression](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/logistic_regression.py)
+* [Perceptron](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/perceptron.py)
+* [Reuters One Vs Rest Classifier](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/reuters_one_vs_rest_classifier.ipynb)
+* [Scoring Functions](https://github.com/TheAlgorithms/Python/blob/master/machine_learning/scoring_functions.py)
+## Maths
+* [Source](https://github.com/TheAlgorithms/Python/tree/master/maths)
+## Matrix
+* [Matrix Multiplication](https://github.com/TheAlgorithms/Python/blob/master/matrix/matrix_multiplication_addition.py)
+* [Search In Sorted Matrix](https://github.com/TheAlgorithms/Python/blob/master/matrix/searching_in_sorted_matrix.py)
+## Networking Flow
+* [Ford Fulkerson](https://github.com/TheAlgorithms/Python/blob/master/networking_flow/ford_fulkerson.py)
+* [Minimum Cut](https://github.com/TheAlgorithms/Python/blob/master/networking_flow/minimum_cut.py)
+## Neural Networks
+* [Bpnn](https://github.com/TheAlgorithms/Python/blob/master/neural_network/bpnn.py)
+* [Convolution Neural Network](https://github.com/TheAlgorithms/Python/blob/master/neural_network/convolution_neural_network.py)
+* [Fcn](https://github.com/TheAlgorithms/Python/blob/master/neural_network/fcn.ipynb)
+* [Perceptron](https://github.com/TheAlgorithms/Python/blob/master/neural_network/perceptron.py)
+## Misc. Others
+* [Source](https://github.com/TheAlgorithms/Python/tree/master/other)
+## Project Euler
+* [Source](https://github.com/TheAlgorithms/Python/tree/master/project_euler)
+## Search
+* [Binary Search](https://github.com/TheAlgorithms/Python/blob/master/searches/binary_search.py)
+* [Interpolation](https://github.com/TheAlgorithms/Python/blob/master/searches/interpolation_search.py)
+* [Jump Search](https://github.com/TheAlgorithms/Python/blob/master/searches/jump_search.py)
+* [Linear Search](https://github.com/TheAlgorithms/Python/blob/master/searches/linear_search.py)
+* [Quick Select](https://github.com/TheAlgorithms/Python/blob/master/searches/quick_select.py)
+* [Sentinel Linear Search](https://github.com/TheAlgorithms/Python/blob/master/searches/sentinel_linear_search.py)
+* [Tabu Search](https://github.com/TheAlgorithms/Python/blob/master/searches/tabu_search.py)
+* [Ternary Search](https://github.com/TheAlgorithms/Python/blob/master/searches/ternary_search.py)
+## Simple Client Server - Networking
+* [Client](https://github.com/TheAlgorithms/Python/blob/master/simple_client/client.py)
+* [Server](https://github.com/TheAlgorithms/Python/blob/master/simple_client/server.py)
+## Sorting
+* [Source](https://github.com/TheAlgorithms/Python/tree/master/sorts)
+## Strings
+* [Knuth Morris Pratt](https://github.com/TheAlgorithms/Python/blob/master/strings/knuth_morris_pratt.py)
+* [Levenshtein Distance](https://github.com/TheAlgorithms/Python/blob/master/strings/levenshtein_distance.py)
+* [Manacher](https://github.com/TheAlgorithms/Python/blob/master/strings/manacher.py)
+* [Min Cost String Conversion](https://github.com/TheAlgorithms/Python/blob/master/strings/min_cost_string_conversion.py)
+* [Naive String Search](https://github.com/TheAlgorithms/Python/blob/master/strings/naive_String_Search.py)
+* [Rabin Karp](https://github.com/TheAlgorithms/Python/blob/master/strings/rabin_karp.py)
+## Traversal
+* [Binary Tree Traversals](https://github.com/TheAlgorithms/Python/blob/master/traversals/binary_tree_traversals.py)