first: sorry for all you english speaking people. it's not my native language!
first: sorry for all you english speaking people. it's not my native language!
with nodeCol you can create nodes and connect them with edges. then the script checks if there is a possibility to colorize the nodes with a specific number of colors without having two nodes, connectet with one edge, getting the same color.
it's a python-gnome script. you need at least python 1.5 and the python-gnome bindings to run it.
all nodes gets the the first color in the range. then the code takes one node after an other, and checks, wether the aktual node partners has the same color like it self. if so, it changes the color of the node to the first free in the range. it could be that there are no colors left in the range. sometimes because there is no posibility to colorize. but often it helps to take a color of an 'not already colorized node'. this one will change its color later.
thats all!
the home of the project is at sourceForge.
nodeCol - a program to check wether a graph could be colorized or not
Copyright (C) 2001 Rodion Trappe
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; either version 2
of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
Rodion Trappe, Brock 25, 48329 Havixbeck, Germany
r-trappe@muenster.de
