[Semester 4] Algorithms and computational complexity - project #2
- C++ 98.2%
- CMake 1.8%
basically what the title describes. it was kinda challenging to think about how to detect directed and undirected graphs though. it is not perfect i must say, as it is missing pattern detection as well as running with both structures, but i will make it later, now is a better time to actually focus on meaningful improvements like making benchmarking structure and the algorithms themselves |
||
|---|---|---|
| input | ||
| src | ||
| .gitignore | ||
| CMakeLists.txt | ||
| LICENSE | ||