https://github.com/i-ser-i/itmo-algorithms-2-sem
https://github.com/i-ser-i/itmo-algorithms-2-sem
algorithms-and-data-structures cpp graph
Last synced: about 1 year ago
JSON representation
- Host: GitHub
- URL: https://github.com/i-ser-i/itmo-algorithms-2-sem
- Owner: I-SER-I
- Archived: true
- Created: 2020-03-11T19:53:46.000Z (over 6 years ago)
- Default Branch: master
- Last Pushed: 2021-04-03T09:54:30.000Z (about 5 years ago)
- Last Synced: 2025-02-07T20:51:36.463Z (over 1 year ago)
- Topics: algorithms-and-data-structures, cpp, graph
- Language: C++
- Homepage:
- Size: 25.4 KB
- Stars: 2
- Watchers: 2
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Data Structures and Algorithms II
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. [x] 1. Breadth-First Search
1. [From the edge list to the adjacency matrix](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%201/A.cpp)
2. [Checking for disorientation](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%201/B.cpp)
3. [Checking for parallel edges](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%201/C.cpp)
4. [Components](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%201/D.cpp)
5. [Shortest path in an unweighted graph](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%201/E.cpp)
6. [Maze](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%201/F.cpp)
2. [x] 2. Depth-First Search
1. [Topsort](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%202/A.cpp)
2. [Cycle search](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%202/B.cpp)
3. [Bipartite graph](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%202/C.cpp)
4. [Сondensation](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%202/D.cpp)
5. [Hamiltonian path](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%202/E.cpp)
6. [Game](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%202/F.cpp)
3. [x] 3. Minimum Spanning Tree
1. [Vertex degree](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%203/A.cpp)
2. [Checking for disorientation](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%203/B.cpp) (Prim's Algorithm)
3. [Checking for parallel edges](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%203/C.cpp) (Prim's Algorithm on set)
4. [Two chinese algorithm](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%203/D.cpp)
4. [x] 4. Shortest paths in a graph
1. [Shortest path](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%204/A.cpp) (Dijkstra Algorithm)
2. [Shortest path from each vertex to each](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%204/B.cpp) (Floyd-Warshall Algorithm)
3. [Shortest path](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%204/C.cpp) (Dijkstra Algorithm on set)
4. [Shortest path and more](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%204/D.cpp) (Bellman-Ford Algorithm)
5. [Negative weight cycle](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%204/E.cpp)
5. [x] 5. Flows in graphs
1. [Maximum flow](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%205/A.cpp) (Edmonds-Karp algorithm)
2. [Matching](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%205/B.cpp) (Hungarian algorithm)
3. [Decomposition](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%205/C.cpp)
4. [Circulation](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%205/D.cpp)
6. [x] 6. Substring Search
1. [Naive substring search](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%206/A.scala)
2. [Quick substring search](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%206/B.cs)
3. [Prefix function](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%206/C.rb)
4. [Knuth–Morris–Pratt machine](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%206/D.kt)