The repository with solutions from Algorithms and Data Structures (Algorytmy i Struktury Danych - ASD) lab classes at AGH UST. Here I will share all of the codes written by me and codes written during laboratories. All codes are written in English but the content of the exercises are written in English and Polish. Also all codes are written according to the PEP 8 style.
This is probably the largest repository with algorithms, solved tasks and additional exercises from the ASD course at the AGH. It contains more than 300 unique codes.
Table of contents consists of specific sections in repository. Algorithm sections consists of algorithms only. Each section, in addition to the algorithms, also contains many tasks that use algorithms which are previously implemented.
- Sorting algorithms:
- Dynamic programming:
- Greedy algorithms:
- Graph algorithms:
- DFS on adjacency list
- DFS on adjacency matrix
- BFS on adjacency list
- BFS on adjacency matrix
- tree diameter
- topological sort
- strongly connected components
- bridges
- Kruskal's MST on adjacency list
- Kruskal's MST on adjacency matrix
- Prim's MST on adjacency list
- Prim's MST on adjacency matrix
- Dijkstra on adjacency list
- Dijkstra on adjacency matrix
- Bellman–Ford algorithm
- Floyd–Warshall algorithm
- Johnson's algorithm
- Edmonds–Karp algorithm
- Ford–Fulkerson algorithm
- Data structures:
- Exercises:
- Obligatory tasks:
- Offline tasks:
- Colloquiums:
If you use this repository/code for classes or for something else, please give me a star or a fork :). It will help me know that my work is important and useful to someone.