https://github.com/thergh/aod
Algorithms for discrete optimisation
https://github.com/thergh/aod
discrete-optimization shortest-path
Last synced: 24 days ago
JSON representation
Algorithms for discrete optimisation
- Host: GitHub
- URL: https://github.com/thergh/aod
- Owner: thergh
- Created: 2024-10-30T09:13:31.000Z (6 months ago)
- Default Branch: main
- Last Pushed: 2025-02-26T22:55:47.000Z (about 2 months ago)
- Last Synced: 2025-02-26T23:32:52.099Z (about 2 months ago)
- Topics: discrete-optimization, shortest-path
- Language: C++
- Homepage:
- Size: 23.7 MB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
### Algorithms for discrete optimisation
### Lab1
Implementation of common graph algorithms: BFS, DFS, checking if a graph is bipartite, finding strongly connected components of a graph, topologically sorting a graph.
### Lab2
Modeling optimisation problems in Julia language for a solver.
### Lab3
Implementing and testing three versions of shortest path algorithms: Dijkstra, Dial and Radix. This exercise originated as a DIMACS programming challange.
### Lab4
Finding a maximum flow in a n-dimensional hypercube graph. Finding maximum matching in a bipartite graph.