Algorithms and Data Structures MIPT 2015 3rd term

Finding of max flow in graph

• O(V^3) - MKM + PushPreFlow algorithms
• Edmonds–Karp algorithm

Algorithms on strings

• Build of Suffix Array O(n) (Induced sort)
• Build Suffix Tree O(n) (Ukkonen)
• Z and prefix - functions
• Manacher's algorithm counting palindroms

Reversi-game bot

• using deep-limited dfs with heuristics