AlgoRithms

=======================

• Big O notation
• SuperStudy Guide | Types of algorithms
• SuperStudy Guide

---

Graph Search Algorythims

Dijkstra

---

A* algorithm

---

Breadth-first search

• Breadth First Search (BFS) | Iterative & Recursive Implementation

---

Depth-first search

---

Bellman–Ford algorithm

---

Johnson's algorithm.

• Source

---

Prim's algorithm

• Source

Fast marching method

• Source

---

Other

Heap queue algorithm / priority queue algorithm

• heapq — Heap queue algorithm --Python Docs--

• --Python Docs-- nsmallest

• Selection algorithm WIKI

• Cache replacement policiesWIKI

• Round-robin schedulingWIKI

• Tail Recursion StackOverflow

• Monte Carlo method

---

Areas of Study

Graphs

• Graph theory
• Graph

---

Different Models

• Fibonacci heap

• Brodal queue

• Motion planning

• Spanning tree

• Minimum spanning tree

• Binary tree

• linear program for computing shortest paths

Projects

• awesome-algorithms --GITHUB--

• TheAlgorithms --GITHUB--

• CookSheets-Algorithms --GITHUB--

• algorithms --GITHUB--

• python-sortedcontainers --GITHUB--

• Algorithm-visualizer

---