There are a number of possible applications for coloring a graph. I was poking around in the neo4j documentation, but did not turn up any examples or canned routines for this.
I was imagining finding something like "ColorGraphNodes([color property name])" which puts a property on each node identifying its color (some sort of integer) and thus would allow you to then get all nodes of a similar color. Do computer scientists have a different name for a coloring than mathematicians (ie, am I just looking for the wrong keyword), or is that something that hasn't really been packaged yet, or maybe it is something with no good scalable algorithms, and thus is not relevant in the large graph world, or maybe folks who need it, implement it themselves on a case-by-case basis? I do not have a specific use case in mind at the moment, just a lot of half baked ideas. -- Rick Otten [email protected] O=='=+ _______________________________________________ Neo4j mailing list [email protected] https://lists.neo4j.org/mailman/listinfo/user
