https://github.com/armavica/coloring
A library to solve Graph Coloring Problems in Rust.
https://github.com/armavica/coloring
graph-coloring optimization simulated-annealing
Last synced: about 2 months ago
JSON representation
A library to solve Graph Coloring Problems in Rust.
- Host: GitHub
- URL: https://github.com/armavica/coloring
- Owner: Armavica
- License: unlicense
- Created: 2017-11-12T17:52:07.000Z (over 7 years ago)
- Default Branch: master
- Last Pushed: 2021-03-17T17:51:44.000Z (about 4 years ago)
- Last Synced: 2025-01-13T07:44:22.316Z (3 months ago)
- Topics: graph-coloring, optimization, simulated-annealing
- Language: Rust
- Homepage:
- Size: 6.84 KB
- Stars: 1
- Watchers: 2
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Graph coloring solver with simulated annealing
This tiny library (toy project) solves the [graph coloring
problem](https://en.wikipedia.org/wiki/Graph_coloring) by [simulated
annealing](https://en.wikipedia.org/wiki/Simulated_annealing).
The provided binary reads the description of a graph on a file or the
standard input, with the following format:
* `N`, `E` on the first line (number of nodes, number of edges)
* `a_i`, `b_i` on the `E` next lines (where `a_i` and `b_i` are nodes of the
graph linked by an edge).
Then, it attempts to solve the graph coloring problem with decreasing
numbers of colors, and write the solutions to files.