Classic-Algorithms

Maze:
MazeRunner (Check unreachable place in a maze)

Cycle Detection on Graphs:
(isCyclic algortithm),
Brend

Binary-tree:
BFS (Breadth First Search),
DFS Interative (Depth First Search),
Huffman Compression,
Kosaraju-Sharir (Strong Connected Component),
Tarjan (Strong Connected Component)

Dynamic Programming:
Kadene,
Knapsack,
Longest Common Subsequence (LCS),
Longest Palindromic Subsequence (LPS)

Graph:
Floyd,
Kruskal,
Dijkastra