{"id":17809247,"url":"https://github.com/i-ser-i/itmo-algorithms-2-sem","last_synced_at":"2025-03-17T16:30:32.550Z","repository":{"id":129067716,"uuid":"246666983","full_name":"I-SER-I/ITMO-Algorithms-2-sem","owner":"I-SER-I","description":null,"archived":true,"fork":false,"pushed_at":"2021-04-03T09:54:30.000Z","size":26,"stargazers_count":2,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-02-07T20:51:36.463Z","etag":null,"topics":["algorithms-and-data-structures","cpp","graph"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":false,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/I-SER-I.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2020-03-11T19:53:46.000Z","updated_at":"2024-07-14T09:35:56.000Z","dependencies_parsed_at":"2023-03-13T11:26:26.706Z","dependency_job_id":null,"html_url":"https://github.com/I-SER-I/ITMO-Algorithms-2-sem","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/I-SER-I%2FITMO-Algorithms-2-sem","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/I-SER-I%2FITMO-Algorithms-2-sem/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/I-SER-I%2FITMO-Algorithms-2-sem/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/I-SER-I%2FITMO-Algorithms-2-sem/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/I-SER-I","download_url":"https://codeload.github.com/I-SER-I/ITMO-Algorithms-2-sem/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244068709,"owners_count":20392879,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms-and-data-structures","cpp","graph"],"created_at":"2024-10-27T15:15:50.560Z","updated_at":"2025-03-17T16:30:32.544Z","avatar_url":"https://github.com/I-SER-I.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Data Structures and Algorithms II\n\nLab. 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.\n\n1. [x] 1. Breadth-First Search\n    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)\n    2. [Checking for disorientation](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%201/B.cpp)\n    3. [Checking for parallel edges](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%201/C.cpp)\n    4. [Components](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%201/D.cpp)\n    5. [Shortest path in an unweighted graph](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%201/E.cpp)\n    6. [Maze](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%201/F.cpp)\n2. [x] 2. Depth-First Search\n    1. [Topsort](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%202/A.cpp)\n    2. [Cycle search](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%202/B.cpp)\n    3. [Bipartite graph](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%202/C.cpp)\n    4. [Сondensation](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%202/D.cpp)\n    5. [Hamiltonian path](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%202/E.cpp)\n    6. [Game](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%202/F.cpp)\n3. [x] 3. Minimum Spanning Tree\n    1. [Vertex degree](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%203/A.cpp)\n    2. [Checking for disorientation](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%203/B.cpp) (Prim's Algorithm)\n    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)\n    4. [Two chinese algorithm](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%203/D.cpp)\n4. [x] 4. Shortest paths in a graph\n    1. [Shortest path](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%204/A.cpp) (Dijkstra Algorithm)\n    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)\n    3. [Shortest path](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%204/C.cpp) (Dijkstra Algorithm on set)\n    4. [Shortest path and more](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%204/D.cpp) (Bellman-Ford Algorithm)\n    5. [Negative weight cycle](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%204/E.cpp)\n5. [x] 5. Flows in graphs\n    1. [Maximum flow](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%205/A.cpp) (Edmonds-Karp algorithm)\n    2. [Matching](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%205/B.cpp) (Hungarian algorithm)\n    3. [Decomposition](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%205/C.cpp)\n    4. [Circulation](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%205/D.cpp)\n6. [x] 6. Substring Search\n    1. [Naive substring search](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%206/A.scala)\n    2. [Quick substring search](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%206/B.cs)\n    3. [Prefix function](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%206/C.rb)\n    4. [Knuth–Morris–Pratt machine](https://github.com/I-SER-I/ITMO-Algorithms-2-sem/blob/master/Lab%206/D.kt)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fi-ser-i%2Fitmo-algorithms-2-sem","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fi-ser-i%2Fitmo-algorithms-2-sem","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fi-ser-i%2Fitmo-algorithms-2-sem/lists"}