This is an interactive graph editor that colors the graph with the least amount of colors possible so there is no node with the same color connected
more information about the problem
demo.mp4
Left button to create a node left button on a node to move it Middle button to connect (if there is no legal target it will create an end node) Right button to delete
Middle button on empty space to create node and start a connection from it
The left button on empty space to create a node and drag it
Right button on the empty space to move everything
ctrl+s to save in a file
ctrl+l to load in a file
ctrl+c to clear
for each node find some of its odd node count cycles
Sort the nodes and connections by the odd cycles found so the algorithm eliminates the maximum amount of odd cycle nodes
Loop:
Chose the first node and set it to the current color (the highest odd cycle node), ignore all the nodes around it and from them chose the next highest priority node
Eliminate the done nodes as its odd cycles as they are now broken
Sort the remaining nodes by their odd cycles
Increment the current color
https://nodejs.org/en/download/
npm i
npm run dev
npm run build
here is the repository to the procedural graph coloring animation generation program