python-algorithms

python-algorithms project is a collection of algorithms implemented on Python3.6 You don’t need to install these project as a module (via pip) because usually you just need only one algorithm instead of all pack, so just copy and paste the source code. For easy navigation please use links to the source code below.

• Arithmetic
  • GCD
  • LCM
• Graphs
  • BFS
  • DFS
  • Dijkstra
  • Bidirectional Dijkstra
  • Cycle detection (DFS)
  • AStar
  • Bellman-Ford (shortest path with negative arbitrage)
  • Kruskal
  • Bellman-Ford (with negative cycle detection)
  • Bipartite
  • BST check
  • Strongly connected components
  • Topological sort
• Greedy
  • Covering segments
  • Fractional Knapsack
• Search
  • Binary Search
  • Closest Pair
  • Fibonacci
  • Fibonacci with modulo
  • Rabin-Karp
• Sorting
  • Merge Sort
  • Quick Sort
• Dynamic programming
  • Knapsack
• Hash Tables
  • Hash Chain