https://github.com/dantasl/graphs
Developing the final project of 2019.1 class of Graphs, at IMD/UFRN. Implementing DSATUR's algorithm.
https://github.com/dantasl/graphs
coloring-graph computer-science dsatur-algorithm graphs
Last synced: 6 months ago
JSON representation
Developing the final project of 2019.1 class of Graphs, at IMD/UFRN. Implementing DSATUR's algorithm.
- Host: GitHub
- URL: https://github.com/dantasl/graphs
- Owner: dantasl
- License: mit
- Created: 2019-06-09T13:06:46.000Z (over 6 years ago)
- Default Branch: master
- Last Pushed: 2019-06-18T12:29:09.000Z (over 6 years ago)
- Last Synced: 2025-02-06T21:24:27.181Z (8 months ago)
- Topics: coloring-graph, computer-science, dsatur-algorithm, graphs
- Language: C++
- Homepage:
- Size: 1.93 MB
- Stars: 0
- Watchers: 0
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Graphs
Developing the final project of 2019.1 class of Graphs, at IMD/UFRN. Implementing DSATUR's algorithm.
## Compiling
The code is compiled using a simple Makefile, configured to run C++11. You can compile this project with:
```make```
## Running
To run this project, you need to provide a valid xml graph file. You can find samples of the test cases inside ```test_cases``` directory.
An example of this is:
```./graphs.out test_cases/test_1_1000_patients.xml```
Where ```graphs.out``` is the executable for this project generated after compiling and ```test_cases/test_1_1000_patients.xml``` is the path to the graph file.
After running, there will be a new file inside ```results``` called ```result_dsatur.txt```. This file is the log of the execution.
### This is a work in progress. There's still some optmizations to be made.