I'm currently studying about algorithms. As such, I decided to share my studies with this open source page that shows those algorithms in action through running demos.

• Dijkstra (Maze)

  Algorithm to find the shortest path.

• Best-First Search (Maze)

  Greedy best first search. Not guaranteed to find shortest path.

• A* Search

  Algorithm combining ideas of Best-First and Dijkstra, finds the shortest path

• Kruskal

  Algorithm to create a minimum spanning tree

• Floyd-Warshall

  Algorithm to find pairs of shortest paths over the entire graph

• Breadth-First Search

  Algorithm to find the shortest path (in terms of nodes visited)

• Binary Trees

  Representation of Binary Trees

• Huffman

  Lossless compression of data using frequency of symbols