Lab. works on Data Structures and Algorithms in ITMO University. The lab work was done in C++ language. The main topic is graphs and finding substings on strings.

1. 1. Breadth-First Search
   1. From the edge list to the adjacency matrix
   2. Checking for disorientation
   3. Checking for parallel edges
   4. Components
   5. Shortest path in an unweighted graph
   6. Maze
2. 2. Depth-First Search
   1. Topsort
   2. Cycle search
   3. Bipartite graph
   4. Сondensation
   5. Hamiltonian path
   6. Game
3. 3. Minimum Spanning Tree
   1. Vertex degree
   2. Checking for disorientation (Prim's Algorithm)
   3. Checking for parallel edges (Prim's Algorithm on set)
   4. Two chinese algorithm
4. 4. Shortest paths in a graph
   1. Shortest path (Dijkstra Algorithm)
   2. Shortest path from each vertex to each (Floyd-Warshall Algorithm)
   3. Shortest path (Dijkstra Algorithm on set)
   4. Shortest path and more (Bellman-Ford Algorithm)
   5. Negative weight cycle
5. 5. Flows in graphs
   1. Maximum flow (Edmonds-Karp algorithm)
   2. Matching (Hungarian algorithm)
   3. Decomposition
   4. Circulation
6. 6. Substring Search
   1. Naive substring search
   2. Quick substring search
   3. Prefix function
   4. Knuth–Morris–Pratt machine