From 91fccecb5688d0a18cf7228ebb6fd7b7f67f4a2f Mon Sep 17 00:00:00 2001 From: Alex Brown Date: Fri, 19 Oct 2018 17:14:25 -0500 Subject: [PATCH] snake_case all the things --- .../compressed_image.png | Bin .../example_image.jpg | Bin .../orignal_image.png | Bin .../PSNR.py => compression_analysis/psnr.py} | 0 .../{FenwickTree.py => fenwick_tree.py} | 0 ...azySegmentTree.py => lazy_segment_tree.py} | 0 .../{SegmentTree.py => segment_tree} | 0 ...blyLinkedList.py => doubly_linked_list.py} | 0 ...ly_LinkedList.py => singly_linked_list.py} | 0 .../queue/{DeQueue.py => deqeue.py} | 0 .../{QueueOnList.py => queue_on_list.py} | 0 ...seudoStack.py => queue_on_pseudo_stack.py} | 0 ...-Span-Problem.py => stock_span_problem.py} | 0 data_structures/trie/{Trie.py => trie.py} | 0 ...lationPoints.py => articulation_points.py} | 0 graphs/{basic-graphs.py => basic_graphs.py} | 0 ...ph_BFS.py => check_bipartite_graph_bfs.py} | 0 .../{FindingBridges.py => finding_bridges.py} | 0 ...orithm_long.py => kahns_algorithm_long.py} | 0 ...orithm_topo.py => kahns_algorithm_topo.py} | 0 ...rims.py => minimum_spanning_tree_prims.py} | 0 ...stic_Astar.py => multi_hueristic_astar.py} | 0 ...b => reuters_one_vs_rest_classifier.ipynb} | 0 maths/{BasicMaths.py => basic_maths.py} | 0 ...ion.py => fibonacci_sequence_recursion.py} | 0 ...onDivisor.py => greater_common_divisor.py} | 0 ...rExponential.py => modular_exponential.py} | 0 .../{SegmentedSieve.py => segmented_sieve.py} | 0 ...atosthenes.py => sieve_of_eratosthenes.py} | 0 maths/{SimpsonRule.py => simpson_rule.py} | 0 ...TrapezoidalRule.py => trapezoidal_rule.py} | 0 .../{Ford_Fulkerson.py => ford_fulkerson.py} | 0 .../{Minimum_cut.py => minimum_cut.py} | 0 neural_network/{FCN.ipynb => fcn.ipynb} | 0 other/{Dictionary.txt => dictionary.txt} | 0 other/{FindingPrimes.py => findingPrimes.py} | 0 ...es_Shuffle.py => fischer_yates_shuffle.py} | 0 ...or.py => linear_congruential_generator.py} | 0 other/{two-sum.py => two_sum.py} | 0 .../{Problem 01 => problem_01}/sol1.py | 0 .../{Problem 01 => problem_01}/sol2.py | 0 .../{Problem 01 => problem_01}/sol3.py | 0 .../{Problem 01 => problem_01}/sol4.py | 0 .../{Problem 02 => problem_02}/sol1.py | 0 .../{Problem 02 => problem_02}/sol2.py | 0 .../{Problem 02 => problem_02}/sol3.py | 0 .../{Problem 03 => problem_03}/sol1.py | 0 .../{Problem 03 => problem_03}/sol2.py | 0 .../{Problem 04 => problem_04}/sol1.py | 0 .../{Problem 04 => problem_04}/sol2.py | 0 .../{Problem 05 => problem_05}/sol1.py | 0 .../{Problem 05 => problem_05}/sol2.py | 0 .../{Problem 06 => problem_06}/sol1.py | 0 .../{Problem 06 => problem_06}/sol2.py | 0 .../{Problem 07 => problem_07}/sol1.py | 0 .../{Problem 07 => problem_07}/sol2.py | 0 .../{Problem 08 => problem_08}/sol1.py | 0 .../{Problem 09 => problem_09}/sol1.py | 0 .../{Problem 09 => problem_09}/sol2.py | 0 .../{Problem 10 => problem_10}/sol1.py | 0 .../{Problem 11 => problem_11}/grid.txt | 0 .../{Problem 11 => problem_11}/sol1.py | 0 .../{Problem 11 => problem_11}/sol2.py | 0 .../{Problem 12 => problem_12}/sol1.py | 0 .../{Problem 13 => problem_13}/sol1.py | 0 .../{Problem 14 => problem_14}/sol1.py | 0 .../{Problem 15 => problem_15}/sol1.py | 0 .../{Problem 16 => problem_16}/sol1.py | 0 .../{Problem 17 => problem_17}/sol1.py | 0 .../{Problem 19 => problem_19}/sol1.py | 0 .../{Problem 20 => problem_20}/sol1.py | 0 .../{Problem 20 => problem_20}/sol2.py | 0 .../{Problem 21 => problem_21}/sol1.py | 0 .../{Problem 22 => problem_22}/p022_names.txt | 0 .../{Problem 22 => problem_22}/sol1.py | 0 .../{Problem 22 => problem_22}/sol2.py | 0 .../{Problem 24 => problem_24}/sol1.py | 0 .../{Problem 25 => problem_25}/sol1.py | 0 .../{Problem 28 => problem_28}/sol1.py | 0 .../{Problem 29 => problem_29}/solution.py | 0 .../{Problem 36 => problem_36}/sol1.py | 0 .../{Problem 40 => problem_40}/sol1.py | 0 .../{Problem 48 => problem_48}/sol1.py | 0 .../{Problem 52 => problem_52}/sol1.py | 0 .../{Problem 53 => problem_53}/sol1.py | 0 .../{Problem 76 => problem_76}/sol1.py | 0 .../{tabuTestData.txt => tabu_test_data.py} | 0 ...E.md => normal_distribution_quick_sort.md} | 0 ...partition.py => quick_sort_3_partition.py} | 0 ...> random_normal_distribution_quicksort.py} | 0 .../{sortinggraphs.png => sorting_graphs.png} | Bin ...-morris-pratt.py => knuth_morris_pratt.py} | 0 ...in-distance.py => levenshtein_distance.py} | 0 ...rsion.py => min_cost_string_conversion.py} | 0 strings/{rabin-karp.py => rabin_karp.py} | 0 tags | 1373 ----------------- 96 files changed, 1373 deletions(-) rename analysis/{Compression_Analysis => compression_analysis}/compressed_image.png (100%) rename analysis/{Compression_Analysis => compression_analysis}/example_image.jpg (100%) rename analysis/{Compression_Analysis => compression_analysis}/orignal_image.png (100%) rename analysis/{Compression_Analysis/PSNR.py => compression_analysis/psnr.py} (100%) rename data_structures/binary tree/{FenwickTree.py => fenwick_tree.py} (100%) rename data_structures/binary tree/{LazySegmentTree.py => lazy_segment_tree.py} (100%) rename data_structures/binary tree/{SegmentTree.py => segment_tree} (100%) rename data_structures/linked_list/{DoublyLinkedList.py => doubly_linked_list.py} (100%) rename data_structures/linked_list/{singly_LinkedList.py => singly_linked_list.py} (100%) rename data_structures/queue/{DeQueue.py => deqeue.py} (100%) rename data_structures/queue/{QueueOnList.py => queue_on_list.py} (100%) rename data_structures/queue/{QueueOnPseudoStack.py => queue_on_pseudo_stack.py} (100%) rename data_structures/stacks/{Stock-Span-Problem.py => stock_span_problem.py} (100%) rename data_structures/trie/{Trie.py => trie.py} (100%) rename graphs/{ArticulationPoints.py => articulation_points.py} (100%) rename graphs/{basic-graphs.py => basic_graphs.py} (100%) rename graphs/{CheckBipartiteGraph_BFS.py => check_bipartite_graph_bfs.py} (100%) rename graphs/{FindingBridges.py => finding_bridges.py} (100%) rename graphs/{KahnsAlgorithm_long.py => kahns_algorithm_long.py} (100%) rename graphs/{KahnsAlgorithm_topo.py => kahns_algorithm_topo.py} (100%) rename graphs/{MinimumSpanningTree_Prims.py => minimum_spanning_tree_prims.py} (100%) rename graphs/{Multi_Hueristic_Astar.py => multi_hueristic_astar.py} (100%) rename machine_learning/{Reuters - OneVsRestClassifier.ipynb => reuters_one_vs_rest_classifier.ipynb} (100%) rename maths/{BasicMaths.py => basic_maths.py} (100%) rename maths/{FibonacciSequenceRecursion.py => fibonacci_sequence_recursion.py} (100%) rename maths/{GreaterCommonDivisor.py => greater_common_divisor.py} (100%) rename maths/{ModularExponential.py => modular_exponential.py} (100%) rename maths/{SegmentedSieve.py => segmented_sieve.py} (100%) rename maths/{SieveOfEratosthenes.py => sieve_of_eratosthenes.py} (100%) rename maths/{SimpsonRule.py => simpson_rule.py} (100%) rename maths/{TrapezoidalRule.py => trapezoidal_rule.py} (100%) rename networking_flow/{Ford_Fulkerson.py => ford_fulkerson.py} (100%) rename networking_flow/{Minimum_cut.py => minimum_cut.py} (100%) rename neural_network/{FCN.ipynb => fcn.ipynb} (100%) rename other/{Dictionary.txt => dictionary.txt} (100%) rename other/{FindingPrimes.py => findingPrimes.py} (100%) rename other/{Fischer-Yates_Shuffle.py => fischer_yates_shuffle.py} (100%) rename other/{LinearCongruentialGenerator.py => linear_congruential_generator.py} (100%) rename other/{two-sum.py => two_sum.py} (100%) rename project_euler/{Problem 01 => problem_01}/sol1.py (100%) rename project_euler/{Problem 01 => problem_01}/sol2.py (100%) rename project_euler/{Problem 01 => problem_01}/sol3.py (100%) rename project_euler/{Problem 01 => problem_01}/sol4.py (100%) rename project_euler/{Problem 02 => problem_02}/sol1.py (100%) rename project_euler/{Problem 02 => problem_02}/sol2.py (100%) rename project_euler/{Problem 02 => problem_02}/sol3.py (100%) rename project_euler/{Problem 03 => problem_03}/sol1.py (100%) rename project_euler/{Problem 03 => problem_03}/sol2.py (100%) rename project_euler/{Problem 04 => problem_04}/sol1.py (100%) rename project_euler/{Problem 04 => problem_04}/sol2.py (100%) rename project_euler/{Problem 05 => problem_05}/sol1.py (100%) rename project_euler/{Problem 05 => problem_05}/sol2.py (100%) rename project_euler/{Problem 06 => problem_06}/sol1.py (100%) rename project_euler/{Problem 06 => problem_06}/sol2.py (100%) rename project_euler/{Problem 07 => problem_07}/sol1.py (100%) rename project_euler/{Problem 07 => problem_07}/sol2.py (100%) rename project_euler/{Problem 08 => problem_08}/sol1.py (100%) rename project_euler/{Problem 09 => problem_09}/sol1.py (100%) rename project_euler/{Problem 09 => problem_09}/sol2.py (100%) rename project_euler/{Problem 10 => problem_10}/sol1.py (100%) rename project_euler/{Problem 11 => problem_11}/grid.txt (100%) rename project_euler/{Problem 11 => problem_11}/sol1.py (100%) rename project_euler/{Problem 11 => problem_11}/sol2.py (100%) rename project_euler/{Problem 12 => problem_12}/sol1.py (100%) rename project_euler/{Problem 13 => problem_13}/sol1.py (100%) rename project_euler/{Problem 14 => problem_14}/sol1.py (100%) rename project_euler/{Problem 15 => problem_15}/sol1.py (100%) rename project_euler/{Problem 16 => problem_16}/sol1.py (100%) rename project_euler/{Problem 17 => problem_17}/sol1.py (100%) rename project_euler/{Problem 19 => problem_19}/sol1.py (100%) rename project_euler/{Problem 20 => problem_20}/sol1.py (100%) rename project_euler/{Problem 20 => problem_20}/sol2.py (100%) rename project_euler/{Problem 21 => problem_21}/sol1.py (100%) rename project_euler/{Problem 22 => problem_22}/p022_names.txt (100%) rename project_euler/{Problem 22 => problem_22}/sol1.py (100%) rename project_euler/{Problem 22 => problem_22}/sol2.py (100%) rename project_euler/{Problem 24 => problem_24}/sol1.py (100%) rename project_euler/{Problem 25 => problem_25}/sol1.py (100%) rename project_euler/{Problem 28 => problem_28}/sol1.py (100%) rename project_euler/{Problem 29 => problem_29}/solution.py (100%) rename project_euler/{Problem 36 => problem_36}/sol1.py (100%) rename project_euler/{Problem 40 => problem_40}/sol1.py (100%) rename project_euler/{Problem 48 => problem_48}/sol1.py (100%) rename project_euler/{Problem 52 => problem_52}/sol1.py (100%) rename project_euler/{Problem 53 => problem_53}/sol1.py (100%) rename project_euler/{Problem 76 => problem_76}/sol1.py (100%) rename searches/{tabuTestData.txt => tabu_test_data.py} (100%) rename sorts/{normal_distribution_QuickSort_README.md => normal_distribution_quick_sort.md} (100%) rename sorts/{quick_sort_3partition.py => quick_sort_3_partition.py} (100%) rename sorts/{random_normaldistribution_quicksort.py => random_normal_distribution_quicksort.py} (100%) rename sorts/{sortinggraphs.png => sorting_graphs.png} (100%) rename strings/{knuth-morris-pratt.py => knuth_morris_pratt.py} (100%) rename strings/{levenshtein-distance.py => levenshtein_distance.py} (100%) rename strings/{min-cost-string-conversion.py => min_cost_string_conversion.py} (100%) rename strings/{rabin-karp.py => rabin_karp.py} (100%) delete mode 100644 tags diff --git a/analysis/Compression_Analysis/compressed_image.png b/analysis/compression_analysis/compressed_image.png similarity index 100% rename from analysis/Compression_Analysis/compressed_image.png rename to analysis/compression_analysis/compressed_image.png diff --git a/analysis/Compression_Analysis/example_image.jpg b/analysis/compression_analysis/example_image.jpg similarity index 100% rename from analysis/Compression_Analysis/example_image.jpg rename to analysis/compression_analysis/example_image.jpg diff --git a/analysis/Compression_Analysis/orignal_image.png b/analysis/compression_analysis/orignal_image.png similarity index 100% rename from analysis/Compression_Analysis/orignal_image.png rename to analysis/compression_analysis/orignal_image.png diff --git a/analysis/Compression_Analysis/PSNR.py b/analysis/compression_analysis/psnr.py similarity index 100% rename from analysis/Compression_Analysis/PSNR.py rename to analysis/compression_analysis/psnr.py diff --git a/data_structures/binary tree/FenwickTree.py b/data_structures/binary tree/fenwick_tree.py similarity index 100% rename from data_structures/binary tree/FenwickTree.py rename to data_structures/binary tree/fenwick_tree.py diff --git a/data_structures/binary tree/LazySegmentTree.py b/data_structures/binary tree/lazy_segment_tree.py similarity index 100% rename from data_structures/binary tree/LazySegmentTree.py rename to data_structures/binary tree/lazy_segment_tree.py diff --git a/data_structures/binary tree/SegmentTree.py b/data_structures/binary tree/segment_tree similarity index 100% rename from data_structures/binary tree/SegmentTree.py rename to data_structures/binary tree/segment_tree diff --git a/data_structures/linked_list/DoublyLinkedList.py b/data_structures/linked_list/doubly_linked_list.py similarity index 100% rename from data_structures/linked_list/DoublyLinkedList.py rename to data_structures/linked_list/doubly_linked_list.py diff --git a/data_structures/linked_list/singly_LinkedList.py b/data_structures/linked_list/singly_linked_list.py similarity index 100% rename from data_structures/linked_list/singly_LinkedList.py rename to data_structures/linked_list/singly_linked_list.py diff --git a/data_structures/queue/DeQueue.py b/data_structures/queue/deqeue.py similarity index 100% rename from data_structures/queue/DeQueue.py rename to data_structures/queue/deqeue.py diff --git a/data_structures/queue/QueueOnList.py b/data_structures/queue/queue_on_list.py similarity index 100% rename from data_structures/queue/QueueOnList.py rename to data_structures/queue/queue_on_list.py diff --git a/data_structures/queue/QueueOnPseudoStack.py b/data_structures/queue/queue_on_pseudo_stack.py similarity index 100% rename from data_structures/queue/QueueOnPseudoStack.py rename to data_structures/queue/queue_on_pseudo_stack.py diff --git a/data_structures/stacks/Stock-Span-Problem.py b/data_structures/stacks/stock_span_problem.py similarity index 100% rename from data_structures/stacks/Stock-Span-Problem.py rename to data_structures/stacks/stock_span_problem.py diff --git a/data_structures/trie/Trie.py b/data_structures/trie/trie.py similarity index 100% rename from data_structures/trie/Trie.py rename to data_structures/trie/trie.py diff --git a/graphs/ArticulationPoints.py b/graphs/articulation_points.py similarity index 100% rename from graphs/ArticulationPoints.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/graphs/CheckBipartiteGraph_BFS.py b/graphs/check_bipartite_graph_bfs.py similarity index 100% rename from graphs/CheckBipartiteGraph_BFS.py rename to graphs/check_bipartite_graph_bfs.py diff --git a/graphs/FindingBridges.py b/graphs/finding_bridges.py similarity index 100% rename from graphs/FindingBridges.py rename to graphs/finding_bridges.py diff --git a/graphs/KahnsAlgorithm_long.py b/graphs/kahns_algorithm_long.py similarity index 100% rename from graphs/KahnsAlgorithm_long.py rename to graphs/kahns_algorithm_long.py diff --git a/graphs/KahnsAlgorithm_topo.py b/graphs/kahns_algorithm_topo.py similarity index 100% rename from graphs/KahnsAlgorithm_topo.py rename to graphs/kahns_algorithm_topo.py diff --git a/graphs/MinimumSpanningTree_Prims.py b/graphs/minimum_spanning_tree_prims.py similarity index 100% rename from graphs/MinimumSpanningTree_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/machine_learning/Reuters - OneVsRestClassifier.ipynb b/machine_learning/reuters_one_vs_rest_classifier.ipynb similarity index 100% rename from machine_learning/Reuters - OneVsRestClassifier.ipynb rename to machine_learning/reuters_one_vs_rest_classifier.ipynb diff --git a/maths/BasicMaths.py b/maths/basic_maths.py similarity index 100% rename from maths/BasicMaths.py rename to maths/basic_maths.py diff --git a/maths/FibonacciSequenceRecursion.py b/maths/fibonacci_sequence_recursion.py similarity index 100% rename from maths/FibonacciSequenceRecursion.py rename to maths/fibonacci_sequence_recursion.py diff --git a/maths/GreaterCommonDivisor.py b/maths/greater_common_divisor.py similarity index 100% rename from maths/GreaterCommonDivisor.py rename to maths/greater_common_divisor.py diff --git a/maths/ModularExponential.py b/maths/modular_exponential.py similarity index 100% rename from maths/ModularExponential.py rename to maths/modular_exponential.py diff --git a/maths/SegmentedSieve.py b/maths/segmented_sieve.py similarity index 100% rename from maths/SegmentedSieve.py rename to maths/segmented_sieve.py diff --git a/maths/SieveOfEratosthenes.py b/maths/sieve_of_eratosthenes.py similarity index 100% rename from maths/SieveOfEratosthenes.py rename to maths/sieve_of_eratosthenes.py diff --git a/maths/SimpsonRule.py b/maths/simpson_rule.py similarity index 100% rename from maths/SimpsonRule.py rename to maths/simpson_rule.py diff --git a/maths/TrapezoidalRule.py b/maths/trapezoidal_rule.py similarity index 100% rename from maths/TrapezoidalRule.py rename to maths/trapezoidal_rule.py diff --git a/networking_flow/Ford_Fulkerson.py b/networking_flow/ford_fulkerson.py similarity index 100% rename from networking_flow/Ford_Fulkerson.py rename to networking_flow/ford_fulkerson.py diff --git a/networking_flow/Minimum_cut.py b/networking_flow/minimum_cut.py similarity index 100% rename from networking_flow/Minimum_cut.py rename to networking_flow/minimum_cut.py diff --git a/neural_network/FCN.ipynb b/neural_network/fcn.ipynb similarity index 100% rename from neural_network/FCN.ipynb rename to neural_network/fcn.ipynb diff --git a/other/Dictionary.txt b/other/dictionary.txt similarity index 100% rename from other/Dictionary.txt rename to other/dictionary.txt diff --git a/other/FindingPrimes.py b/other/findingPrimes.py similarity index 100% rename from other/FindingPrimes.py rename to other/findingPrimes.py diff --git a/other/Fischer-Yates_Shuffle.py b/other/fischer_yates_shuffle.py similarity index 100% rename from other/Fischer-Yates_Shuffle.py rename to other/fischer_yates_shuffle.py diff --git a/other/LinearCongruentialGenerator.py b/other/linear_congruential_generator.py similarity index 100% rename from other/LinearCongruentialGenerator.py rename to other/linear_congruential_generator.py diff --git a/other/two-sum.py b/other/two_sum.py similarity index 100% rename from other/two-sum.py rename to other/two_sum.py diff --git a/project_euler/Problem 01/sol1.py b/project_euler/problem_01/sol1.py similarity index 100% rename from project_euler/Problem 01/sol1.py rename to project_euler/problem_01/sol1.py diff --git a/project_euler/Problem 01/sol2.py b/project_euler/problem_01/sol2.py similarity index 100% rename from project_euler/Problem 01/sol2.py rename to project_euler/problem_01/sol2.py diff --git a/project_euler/Problem 01/sol3.py b/project_euler/problem_01/sol3.py similarity index 100% rename from project_euler/Problem 01/sol3.py rename to project_euler/problem_01/sol3.py diff --git a/project_euler/Problem 01/sol4.py b/project_euler/problem_01/sol4.py similarity index 100% rename from project_euler/Problem 01/sol4.py rename to project_euler/problem_01/sol4.py diff --git a/project_euler/Problem 02/sol1.py b/project_euler/problem_02/sol1.py similarity index 100% rename from project_euler/Problem 02/sol1.py rename to project_euler/problem_02/sol1.py diff --git a/project_euler/Problem 02/sol2.py b/project_euler/problem_02/sol2.py similarity index 100% rename from project_euler/Problem 02/sol2.py rename to project_euler/problem_02/sol2.py diff --git a/project_euler/Problem 02/sol3.py b/project_euler/problem_02/sol3.py similarity index 100% rename from project_euler/Problem 02/sol3.py rename to project_euler/problem_02/sol3.py diff --git a/project_euler/Problem 03/sol1.py b/project_euler/problem_03/sol1.py similarity index 100% rename from project_euler/Problem 03/sol1.py rename to project_euler/problem_03/sol1.py diff --git a/project_euler/Problem 03/sol2.py b/project_euler/problem_03/sol2.py similarity index 100% rename from project_euler/Problem 03/sol2.py rename to project_euler/problem_03/sol2.py diff --git a/project_euler/Problem 04/sol1.py b/project_euler/problem_04/sol1.py similarity index 100% rename from project_euler/Problem 04/sol1.py rename to project_euler/problem_04/sol1.py diff --git a/project_euler/Problem 04/sol2.py b/project_euler/problem_04/sol2.py similarity index 100% rename from project_euler/Problem 04/sol2.py rename to project_euler/problem_04/sol2.py diff --git a/project_euler/Problem 05/sol1.py b/project_euler/problem_05/sol1.py similarity index 100% rename from project_euler/Problem 05/sol1.py rename to project_euler/problem_05/sol1.py diff --git a/project_euler/Problem 05/sol2.py b/project_euler/problem_05/sol2.py similarity index 100% rename from project_euler/Problem 05/sol2.py rename to project_euler/problem_05/sol2.py diff --git a/project_euler/Problem 06/sol1.py b/project_euler/problem_06/sol1.py similarity index 100% rename from project_euler/Problem 06/sol1.py rename to project_euler/problem_06/sol1.py diff --git a/project_euler/Problem 06/sol2.py b/project_euler/problem_06/sol2.py similarity index 100% rename from project_euler/Problem 06/sol2.py rename to project_euler/problem_06/sol2.py diff --git a/project_euler/Problem 07/sol1.py b/project_euler/problem_07/sol1.py similarity index 100% rename from project_euler/Problem 07/sol1.py rename to project_euler/problem_07/sol1.py diff --git a/project_euler/Problem 07/sol2.py b/project_euler/problem_07/sol2.py similarity index 100% rename from project_euler/Problem 07/sol2.py rename to project_euler/problem_07/sol2.py diff --git a/project_euler/Problem 08/sol1.py b/project_euler/problem_08/sol1.py similarity index 100% rename from project_euler/Problem 08/sol1.py rename to project_euler/problem_08/sol1.py diff --git a/project_euler/Problem 09/sol1.py b/project_euler/problem_09/sol1.py similarity index 100% rename from project_euler/Problem 09/sol1.py rename to project_euler/problem_09/sol1.py diff --git a/project_euler/Problem 09/sol2.py b/project_euler/problem_09/sol2.py similarity index 100% rename from project_euler/Problem 09/sol2.py rename to project_euler/problem_09/sol2.py diff --git a/project_euler/Problem 10/sol1.py b/project_euler/problem_10/sol1.py similarity index 100% rename from project_euler/Problem 10/sol1.py rename to project_euler/problem_10/sol1.py diff --git a/project_euler/Problem 11/grid.txt b/project_euler/problem_11/grid.txt similarity index 100% rename from project_euler/Problem 11/grid.txt rename to project_euler/problem_11/grid.txt diff --git a/project_euler/Problem 11/sol1.py b/project_euler/problem_11/sol1.py similarity index 100% rename from project_euler/Problem 11/sol1.py rename to project_euler/problem_11/sol1.py diff --git a/project_euler/Problem 11/sol2.py b/project_euler/problem_11/sol2.py similarity index 100% rename from project_euler/Problem 11/sol2.py rename to project_euler/problem_11/sol2.py diff --git a/project_euler/Problem 12/sol1.py b/project_euler/problem_12/sol1.py similarity index 100% rename from project_euler/Problem 12/sol1.py rename to project_euler/problem_12/sol1.py diff --git a/project_euler/Problem 13/sol1.py b/project_euler/problem_13/sol1.py similarity index 100% rename from project_euler/Problem 13/sol1.py rename to project_euler/problem_13/sol1.py diff --git a/project_euler/Problem 14/sol1.py b/project_euler/problem_14/sol1.py similarity index 100% rename from project_euler/Problem 14/sol1.py rename to project_euler/problem_14/sol1.py diff --git a/project_euler/Problem 15/sol1.py b/project_euler/problem_15/sol1.py similarity index 100% rename from project_euler/Problem 15/sol1.py rename to project_euler/problem_15/sol1.py diff --git a/project_euler/Problem 16/sol1.py b/project_euler/problem_16/sol1.py similarity index 100% rename from project_euler/Problem 16/sol1.py rename to project_euler/problem_16/sol1.py diff --git a/project_euler/Problem 17/sol1.py b/project_euler/problem_17/sol1.py similarity index 100% rename from project_euler/Problem 17/sol1.py rename to project_euler/problem_17/sol1.py diff --git a/project_euler/Problem 19/sol1.py b/project_euler/problem_19/sol1.py similarity index 100% rename from project_euler/Problem 19/sol1.py rename to project_euler/problem_19/sol1.py diff --git a/project_euler/Problem 20/sol1.py b/project_euler/problem_20/sol1.py similarity index 100% rename from project_euler/Problem 20/sol1.py rename to project_euler/problem_20/sol1.py diff --git a/project_euler/Problem 20/sol2.py b/project_euler/problem_20/sol2.py similarity index 100% rename from project_euler/Problem 20/sol2.py rename to project_euler/problem_20/sol2.py diff --git a/project_euler/Problem 21/sol1.py b/project_euler/problem_21/sol1.py similarity index 100% rename from project_euler/Problem 21/sol1.py rename to project_euler/problem_21/sol1.py diff --git a/project_euler/Problem 22/p022_names.txt b/project_euler/problem_22/p022_names.txt similarity index 100% rename from project_euler/Problem 22/p022_names.txt rename to project_euler/problem_22/p022_names.txt diff --git a/project_euler/Problem 22/sol1.py b/project_euler/problem_22/sol1.py similarity index 100% rename from project_euler/Problem 22/sol1.py rename to project_euler/problem_22/sol1.py diff --git a/project_euler/Problem 22/sol2.py b/project_euler/problem_22/sol2.py similarity index 100% rename from project_euler/Problem 22/sol2.py rename to project_euler/problem_22/sol2.py diff --git a/project_euler/Problem 24/sol1.py b/project_euler/problem_24/sol1.py similarity index 100% rename from project_euler/Problem 24/sol1.py rename to project_euler/problem_24/sol1.py diff --git a/project_euler/Problem 25/sol1.py b/project_euler/problem_25/sol1.py similarity index 100% rename from project_euler/Problem 25/sol1.py rename to project_euler/problem_25/sol1.py diff --git a/project_euler/Problem 28/sol1.py b/project_euler/problem_28/sol1.py similarity index 100% rename from project_euler/Problem 28/sol1.py rename to project_euler/problem_28/sol1.py diff --git a/project_euler/Problem 29/solution.py b/project_euler/problem_29/solution.py similarity index 100% rename from project_euler/Problem 29/solution.py rename to project_euler/problem_29/solution.py diff --git a/project_euler/Problem 36/sol1.py b/project_euler/problem_36/sol1.py similarity index 100% rename from project_euler/Problem 36/sol1.py rename to project_euler/problem_36/sol1.py diff --git a/project_euler/Problem 40/sol1.py b/project_euler/problem_40/sol1.py similarity index 100% rename from project_euler/Problem 40/sol1.py rename to project_euler/problem_40/sol1.py diff --git a/project_euler/Problem 48/sol1.py b/project_euler/problem_48/sol1.py similarity index 100% rename from project_euler/Problem 48/sol1.py rename to project_euler/problem_48/sol1.py diff --git a/project_euler/Problem 52/sol1.py b/project_euler/problem_52/sol1.py similarity index 100% rename from project_euler/Problem 52/sol1.py rename to project_euler/problem_52/sol1.py diff --git a/project_euler/Problem 53/sol1.py b/project_euler/problem_53/sol1.py similarity index 100% rename from project_euler/Problem 53/sol1.py rename to project_euler/problem_53/sol1.py diff --git a/project_euler/Problem 76/sol1.py b/project_euler/problem_76/sol1.py similarity index 100% rename from project_euler/Problem 76/sol1.py rename to project_euler/problem_76/sol1.py diff --git a/searches/tabuTestData.txt b/searches/tabu_test_data.py similarity index 100% rename from searches/tabuTestData.txt rename to searches/tabu_test_data.py diff --git a/sorts/normal_distribution_QuickSort_README.md b/sorts/normal_distribution_quick_sort.md similarity index 100% rename from sorts/normal_distribution_QuickSort_README.md rename to sorts/normal_distribution_quick_sort.md diff --git a/sorts/quick_sort_3partition.py b/sorts/quick_sort_3_partition.py similarity index 100% rename from sorts/quick_sort_3partition.py rename to sorts/quick_sort_3_partition.py diff --git a/sorts/random_normaldistribution_quicksort.py b/sorts/random_normal_distribution_quicksort.py similarity index 100% rename from sorts/random_normaldistribution_quicksort.py rename to sorts/random_normal_distribution_quicksort.py diff --git a/sorts/sortinggraphs.png b/sorts/sorting_graphs.png similarity index 100% rename from sorts/sortinggraphs.png rename to sorts/sorting_graphs.png diff --git a/strings/knuth-morris-pratt.py b/strings/knuth_morris_pratt.py similarity index 100% rename from strings/knuth-morris-pratt.py rename to strings/knuth_morris_pratt.py diff --git a/strings/levenshtein-distance.py b/strings/levenshtein_distance.py similarity index 100% rename from strings/levenshtein-distance.py rename to strings/levenshtein_distance.py diff --git a/strings/min-cost-string-conversion.py b/strings/min_cost_string_conversion.py similarity index 100% rename from strings/min-cost-string-conversion.py rename to strings/min_cost_string_conversion.py diff --git a/strings/rabin-karp.py b/strings/rabin_karp.py similarity index 100% rename from strings/rabin-karp.py rename to strings/rabin_karp.py diff --git a/tags b/tags deleted file mode 100644 index 46f6330e8..000000000 --- a/tags +++ /dev/null @@ -1,1373 +0,0 @@ -!_TAG_FILE_FORMAT 2 /extended format; --format=1 will not append ;" to lines/ -!_TAG_FILE_SORTED 1 /0=unsorted, 1=sorted, 2=foldcase/ -!_TAG_OUTPUT_MODE u-ctags /u-ctags or e-ctags/ -!_TAG_PROGRAM_AUTHOR Universal Ctags Team // -!_TAG_PROGRAM_NAME Universal Ctags /Derived from Exuberant Ctags/ -!_TAG_PROGRAM_URL https://ctags.io/ /official site/ -!_TAG_PROGRAM_VERSION 0.0.0 /619a6fac/ -- returns a random matrix WxH with integer components between 'a' and 'b' linear_algebra_python/README.md /^ - returns a random matrix WxH with integer components between 'a' and 'b' $/;" s -A data_structures/binary tree/LazySegmentTree.py /^ A = [1,2,-4,7,3,-5,6,11,-20,9,14,15,5,2,-8]$/;" v -A data_structures/binary tree/SegmentTree.py /^ A = [1,2,-4,7,3,-5,6,11,-20,9,14,15,5,2,-8]$/;" v -AVL data_structures/avl.py /^class AVL:$/;" c -AdjacencyList data_structures/graph/graph.py /^class AdjacencyList(object):$/;" c -All algorithms implemented in Python (for education) README.md /^### All algorithms implemented in Python (for education)$/;" S -Array Elements sorts/normal_distribution_QuickSort_README.md /^## Array Elements$/;" s -BFS data_structures/graph/breadth_first_search.py /^ def BFS(self, startVertex):$/;" m class:Graph -BFS networking_flow/Ford_Fulkerson.py /^def BFS(graph, s, t, parent):$/;" f -BFS networking_flow/Minimum_cut.py /^def BFS(graph, s, t, parent):$/;" f -BLOCK_FILENAME_FORMAT sorts/external-sort.py /^ BLOCK_FILENAME_FORMAT = 'block_{0}.dat'$/;" v class:FileSplitter -BPNN neural_network/bpnn.py /^class BPNN():$/;" c -BYTE_SIZE ciphers/rsa_cipher.py /^BYTE_SIZE = 256$/;" v -BellmanFord data_structures/graph/bellman_ford.py /^def BellmanFord(graph, V, E, src):$/;" f -Binary README.md /^### Binary$/;" S -BinarySearchTree data_structures/binary tree/binary_search_tree.py /^class BinarySearchTree:$/;" c -Bubble README.md /^### Bubble$/;" S -Bucket README.md /^### Bucket$/;" S -CNN neural_network/convolution_neural_network.py /^class CNN():$/;" c -Caesar README.md /^### Caesar$/;" S -CeilIndex dynamic_programming/longest_increasing_subsequence_O(nlogn).py /^def CeilIndex(v,l,r,key):$/;" f -Ciphers README.md /^## Ciphers$/;" s -Cocktail shaker README.md /^### Cocktail shaker$/;" S -DEFAULT_BLOCK_SIZE ciphers/rsa_cipher.py /^DEFAULT_BLOCK_SIZE = 128$/;" v -DEFAULT_BUCKET_SIZE sorts/bucket_sort.py /^DEFAULT_BUCKET_SIZE = 5$/;" v -DFS data_structures/graph/depth_first_search.py /^ def DFS(self):$/;" m class:Graph -DFSRec data_structures/graph/depth_first_search.py /^ def DFSRec(self, startVertex, visited):$/;" m class:Graph -DISTANCE searches/test_tabu_search.py /^DISTANCE = 105$/;" v -Decision_Tree machine_learning/decision_tree.py /^class Decision_Tree:$/;" c -DenseLayer neural_network/bpnn.py /^class DenseLayer():$/;" c -Dijkstra data_structures/graph/dijkstra.py /^def Dijkstra(graph, V, src):$/;" f -Documentation linear_algebra_python/README.md /^## Documentation $/;" s -DoubleHash data_structures/hashing/double_hash.py /^class DoubleHash(HashTable):$/;" c -E data_structures/graph/bellman_ford.py /^E = int(raw_input("Enter number of edges: "))$/;" v -E data_structures/graph/dijkstra.py /^E = int(raw_input("Enter number of edges: "))$/;" v -E data_structures/graph/floyd_warshall.py /^E = int(raw_input("Enter number of edges: "))$/;" v -ENGLISH_WORDS other/detecting_english_programmatically.py /^ENGLISH_WORDS = loadDictionary()$/;" v -ETAOIN other/frequency_finder.py /^ETAOIN = 'ETAOINSHRDLCUMWFGYPBVKJXQZ'$/;" v -EditDistance dynamic_programming/edit_distance.py /^class EditDistance:$/;" c -ExternalSort sorts/external-sort.py /^class ExternalSort(object):$/;" c -F dynamic_programming/knapsack.py /^ F = [[0]*(w + 1)] + [[0] + [-1 for i in range(w + 1)] for j in range(n + 1)]$/;" v -FIRST_SOLUTION searches/test_tabu_search.py /^FIRST_SOLUTION = ['a', 'c', 'b', 'd', 'e', 'a']$/;" v -FYshuffle other/Fischer-Yates_Shuffle.py /^def FYshuffle(LIST):$/;" f -FenwickTree data_structures/binary tree/FenwickTree.py /^class FenwickTree:$/;" c -Fibonacci dynamic_programming/fibonacci.py /^class Fibonacci:$/;" c -FileMerger sorts/external-sort.py /^class FileMerger(object):$/;" c -FileSplitter sorts/external-sort.py /^class FileSplitter(object):$/;" c -FilesArray sorts/external-sort.py /^class FilesArray(object):$/;" c -FloydWarshall data_structures/graph/floyd_warshall.py /^def FloydWarshall(graph, V):$/;" f -FordFulkerson networking_flow/Ford_Fulkerson.py /^def FordFulkerson(graph, source, sink):$/;" f -Graph data_structures/graph/breadth_first_search.py /^class Graph():$/;" c -Graph data_structures/graph/depth_first_search.py /^class Graph():$/;" c -Graph data_structures/graph/dijkstra_algorithm.py /^class Graph:$/;" c -Graph data_structures/graph/graph_list.py /^class Graph:$/;" c -Graph data_structures/graph/graph_matrix.py /^class Graph:$/;" c -Graph dynamic_programming/floyd_warshall.py /^class Graph:$/;" c -HOST simple_client_server/client.py /^HOST, PORT = '127.0.0.1', 1400$/;" v -HOST simple_client_server/server.py /^HOST, PORT = '127.0.0.1', 1400$/;" v -HashTable data_structures/hashing/hash_table.py /^class HashTable:$/;" c -HashTableWithLinkedList data_structures/hashing/hash_table_with_linked_list.py /^class HashTableWithLinkedList(HashTable):$/;" c -Heap README.md /^### Heap$/;" S -Heap data_structures/heap/heap.py /^class Heap:$/;" c -InPreOrder data_structures/binary tree/binary_search_tree.py /^def InPreOrder(curr_node):$/;" f -Insertion README.md /^### Insertion$/;" S -Interpolation README.md /^## Interpolation$/;" s -Jump Search README.md /^## Jump Search$/;" s -K hashes/chaos_machine.py /^K = [0.33, 0.44, 0.55, 0.44, 0.33]; t = 3; m = 5$/;" v -L arithmetic_analysis/lu_decomposition.py /^L,U = LUDecompose(matrix)$/;" v -LEARNING_RATE machine_learning/gradient_descent.py /^LEARNING_RATE = 0.009$/;" v -LETTERS ciphers/simple_substitution_cipher.py /^LETTERS = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'$/;" v -LETTERS ciphers/vigenere_cipher.py /^LETTERS = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'$/;" v -LETTERS other/frequency_finder.py /^LETTERS = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'$/;" v -LETTERS_AND_SPACE other/detecting_english_programmatically.py /^LETTERS_AND_SPACE = UPPERLETTERS + UPPERLETTERS.lower() + ' \\t\\n'$/;" v -LUDecompose arithmetic_analysis/lu_decomposition.py /^def LUDecompose (table):$/;" f -Linear README.md /^### Linear$/;" S -Linear algebra library for Python linear_algebra_python/README.md /^# Linear algebra library for Python $/;" c -LinearCongruentialGenerator other/LinearCongruentialGenerator.py /^class LinearCongruentialGenerator(object):$/;" c -Link data_structures/linked_list/DoublyLinkedList.py /^class Link:$/;" c -LinkedList data_structures/linked_list/DoublyLinkedList.py /^class LinkedList:$/;" c -LinkedList data_structures/linked_list/__init__.py /^class LinkedList:$/;" c -Linked_List data_structures/linked_list/singly_LinkedList.py /^class Linked_List:$/;" c -LongestIncreasingSubsequenceLength dynamic_programming/longest_increasing_subsequence_O(nlogn).py /^def LongestIncreasingSubsequenceLength(v):$/;" f -M sorts/random_normaldistribution_quicksort.py /^M = np.load(outfile)$/;" v -MF_knapsack dynamic_programming/knapsack.py /^def MF_knapsack(i,wt,val,j):$/;" f -Matrix linear_algebra_python/src/lib.py /^class Matrix(object):$/;" c -MatrixChainOrder dynamic_programming/matrix_chain_order.py /^def MatrixChainOrder(array):$/;" f -Merge README.md /^### Merge$/;" S -N data_structures/binary tree/LazySegmentTree.py /^ N = 15$/;" v -N data_structures/binary tree/SegmentTree.py /^ N = 15$/;" v -N project_euler/Problem 09/sol2.py /^N = int(raw_input())$/;" v -NEIGHBOURHOOD_OF_SOLUTIONS searches/test_tabu_search.py /^NEIGHBOURHOOD_OF_SOLUTIONS = [['a', 'e', 'b', 'd', 'c', 'a', 90],$/;" v -NEIGHBOURS_DICT searches/test_tabu_search.py /^NEIGHBOURS_DICT = {'a': [['b', '20'], ['c', '18'], ['d', '22'], ['e', '26']],$/;" v -NWayMerge sorts/external-sort.py /^class NWayMerge(object):$/;" c -NewtonRaphson arithmetic_analysis/newton_raphson_method.py /^def NewtonRaphson(func, a):$/;" f -Node data_structures/avl.py /^class Node:$/;" c -Node data_structures/binary tree/binary_search_tree.py /^class Node:$/;" c -Node data_structures/linked_list/__init__.py /^class Node:$/;" c -Node data_structures/linked_list/singly_LinkedList.py /^class Node: # create a Node$/;" c -Normal Distribution QuickSort sorts/normal_distribution_QuickSort_README.md /^# Normal Distribution QuickSort$/;" c -Note: simple_client_server/README.md /^#### Note:$/;" t -Onepad ciphers/onepad_cipher.py /^class Onepad:$/;" c -Overview linear_algebra_python/README.md /^## Overview $/;" s -PORT simple_client_server/client.py /^HOST, PORT = '127.0.0.1', 1400$/;" v -PORT simple_client_server/server.py /^HOST, PORT = '127.0.0.1', 1400$/;" v -PROGNAME other/sierpinski_triangle.py /^PROGNAME = 'Sierpinski Triangle'$/;" v -Perceptron machine_learning/perceptron.py /^class Perceptron:$/;" c -Perceptron neural_network/perceptron.py /^class Perceptron:$/;" c -Plotting the function for Checking 'The Number of Comparisons' taking place between Normal Distribution QuickSort and Ordinary QuickSort sorts/normal_distribution_QuickSort_README.md /^## Plotting the function for Checking 'The Number of Comparisons' taking place between Normal Di/;" s -PrimsAlgorithm graphs/MinimumSpanningTree_Prims.py /^def PrimsAlgorithm(l):$/;" f -PrintOptimalSolution dynamic_programming/matrix_chain_order.py /^def PrintOptimalSolution(OptimalSolution,i,j):$/;" f -PriorityQueue data_structures/graph/dijkstra_algorithm.py /^class PriorityQueue:$/;" c -PriorityQueue graphs/Multi_Hueristic_Astar.py /^class PriorityQueue:$/;" c -ProjectEuler project_euler/README.md /^# ProjectEuler$/;" c -QuadraticProbing data_structures/hashing/__init__.py /^class QuadraticProbing(HashTable):$/;" c -QuadraticProbing data_structures/hashing/quadratic_probing.py /^class QuadraticProbing(HashTable):$/;" c -Queue data_structures/queue/QueueOnList.py /^class Queue():$/;" c -Queue data_structures/queue/QueueOnPseudoStack.py /^class Queue():$/;" c -Quick README.md /^### Quick$/;" S -Quick Select README.md /^## Quick Select$/;" s -ROT13 README.md /^## ROT13$/;" s -RSA (Rivest–Shamir–Adleman) README.md /^### RSA (Rivest–Shamir–Adleman)$/;" S -Radix README.md /^### Radix$/;" S -ReadModel neural_network/convolution_neural_network.py /^ def ReadModel(cls,model_path):$/;" m class:CNN -ReceiveFile file_transfer_protocol/ftp_send_receive.py /^def ReceiveFile():$/;" f -Representational analysis/Compression_Analysis/PSNR.py /^def Representational(r,g,b):$/;" f -S data_structures/stacks/Stock-Span-Problem.py /^S = [0 for i in range(len(price)+1)] $/;" v -S1 dynamic_programming/edit_distance.py /^ S1 = raw_input().strip()$/;" v -S2 dynamic_programming/edit_distance.py /^ S2 = raw_input().strip()$/;" v -SHA1Hash hashes/sha1.py /^class SHA1Hash:$/;" c -SHA1HashTest hashes/sha1.py /^class SHA1HashTest(unittest.TestCase):$/;" c -SOE other/FindingPrimes.py /^def SOE(n):$/;" f -SYMBOLS ciphers/affine_cipher.py /^SYMBOLS = """ !"#$%&'()*+,-.\/0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnop/;" v -Search Algorithms README.md /^## Search Algorithms$/;" s -SegmentTree data_structures/binary tree/LazySegmentTree.py /^class SegmentTree:$/;" c -SegmentTree data_structures/binary tree/SegmentTree.py /^class SegmentTree:$/;" c -Selection README.md /^### Selection$/;" S -SendFile file_transfer_protocol/ftp_send_receive.py /^def SendFile():$/;" f -Shell README.md /^### Shell$/;" S -Sort Algorithms README.md /^## Sort Algorithms$/;" s -Source: [Wikipedia](https://en.wikipedia.org/wiki/Caesar_cipher) README.md /^###### Source: [Wikipedia](https:\/\/en.wikipedia.org\/wiki\/Caesar_cipher)$/;" u -Source: [Wikipedia](https://en.wikipedia.org/wiki/Interpolation_search) README.md /^###### Source: [Wikipedia](https:\/\/en.wikipedia.org\/wiki\/Interpolation_search)$/;" u -Source: [Wikipedia](https://en.wikipedia.org/wiki/Jump_search) README.md /^###### Source: [Wikipedia](https:\/\/en.wikipedia.org\/wiki\/Jump_search)$/;" u -Source: [Wikipedia](https://en.wikipedia.org/wiki/Quickselect) README.md /^###### Source: [Wikipedia](https:\/\/en.wikipedia.org\/wiki\/Quickselect)$/;" u -Source: [Wikipedia](https://en.wikipedia.org/wiki/ROT13) README.md /^###### Source: [Wikipedia](https:\/\/en.wikipedia.org\/wiki\/ROT13)$/;" u -Source: [Wikipedia](https://en.wikipedia.org/wiki/RSA_(cryptosystem)) README.md /^###### Source: [Wikipedia](https:\/\/en.wikipedia.org\/wiki\/RSA_(cryptosystem))$/;" u -Source: [Wikipedia](https://en.wikipedia.org/wiki/Tabu_search) README.md /^###### Source: [Wikipedia](https:\/\/en.wikipedia.org\/wiki\/Tabu_search)$/;" u -Source: [Wikipedia](https://en.wikipedia.org/wiki/Transposition_cipher) README.md /^###### Source: [Wikipedia](https:\/\/en.wikipedia.org\/wiki\/Transposition_cipher)$/;" u -Source: [Wikipedia](https://en.wikipedia.org/wiki/Vigen%C3%A8re_cipher) README.md /^###### Source: [Wikipedia](https:\/\/en.wikipedia.org\/wiki\/Vigen%C3%A8re_cipher)$/;" u -Source: [Wikipedia](https://en.wikipedia.org/wiki/XOR_cipher) README.md /^###### Source: [Wikipedia](https:\/\/en.wikipedia.org\/wiki\/XOR_cipher)$/;" u -Stack data_structures/stacks/__init__.py /^class Stack:$/;" c -Stack data_structures/stacks/stack.py /^class Stack(object):$/;" c -StackOverflowError data_structures/stacks/stack.py /^class StackOverflowError(BaseException):$/;" c -SubArray dynamic_programming/longest_sub_array.py /^class SubArray:$/;" c -T project_euler/Problem 02/sol2.py /^T = int(input().strip())$/;" v -TAG machine_learning/k_means_clust.py /^TAG = 'K-MEANS-CLUST\/ '$/;" v -TEST_FILE searches/test_tabu_search.py /^TEST_FILE = os.path.join(os.path.dirname(__file__), '.\/tabuTestData.txt')$/;" v -TFKMeansCluster dynamic_programming/k_means_clustering_tensorflow.py /^def TFKMeansCluster(vectors, noofclusters):$/;" f -Tabu README.md /^## Tabu$/;" s -Test linear_algebra_python/src/tests.py /^class Test(unittest.TestCase):$/;" c -TestClass searches/test_tabu_search.py /^class TestClass(unittest.TestCase):$/;" c -TestUnionFind data_structures/union_find/tests_union_find.py /^class TestUnionFind(unittest.TestCase):$/;" c -Tests linear_algebra_python/README.md /^## Tests $/;" s -The Algorithms - Python README.md /^# The Algorithms - Python