Implementation of Hopfield Network for k-Coloring Problem in Graph Theory
How to use
My program can takes inputs in DIMACS format from the commandline as an argument.
Just copy the DIMACS col file into the same directory.
Compilation
g++ *.cpp -O3 -o hop
Example
For Linux Systems
./hop k4.col
It will create a file hopfield.txt which will contain the number of colours used and time taken to colour the graph in millisecond