https://github.com/pklatka/graph-algorithms-course

Solutions for graph algorithms course at AGH UST.
https://github.com/pklatka/graph-algorithms-course

Last synced: 8 days ago
JSON representation

Solutions for graph algorithms course at AGH UST.

• Host: GitHub
• URL: https://github.com/pklatka/graph-algorithms-course
• Owner: pklatka
• Created: 2022-11-13T23:32:42.000Z (about 2 years ago)
• Default Branch: main
• Last Pushed: 2023-10-03T08:29:15.000Z (over 1 year ago)
• Last Synced: 2023-10-03T20:01:19.807Z (over 1 year ago)
• Language: Python
• Homepage:
• Size: 4.23 MB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Graph algorithms course

This repository contains solutions for graph algorithms course at AGH UST. Every task is in a separate folder. Solutions were written using Python. Each folder contains a task description in Polish.

## Tasks

- [lab1](https://github.com/pklatka/graph-algorithms-course/tree/main/lab1): finding the most expensive path in a graph

- [lab2](https://github.com/pklatka/graph-algorithms-course/tree/main/lab2): max-flow algorithm implementation

- [lab3](https://github.com/pklatka/graph-algorithms-course/tree/main/lab3): solving minimum cut problem with max-flow and Stoer-Wagner algorithm

- [lab4](https://github.com/pklatka/graph-algorithms-course/tree/main/lab4): detecting chordal graphs, finding the greatest clique in graph, calculating chromatic number of graph, the minimum vertex cover problem

- [project1](https://github.com/pklatka/graph-algorithms-course/tree/main/project1): finding minimum cost of planning K performances

If this repository helped you, don't forget to star ⭐️ or fork🍴.