I have posted this question at MathOverflow.com as well. I am no mathematician and English is not my first language, so please excuse me if my question is too stupid, it is poorly phrased, or both.
I am developing a program that creates timetables. My timetable-creating algorithm, besides creating the timetable, also creates a graph whose nodes represent each class I have already programmed, and whose arcs represent which pairs of classes should not be programmed at the same time, even if they have to be reprogrammed. The more “heavily linked” a node is, the more inflexible its associated class is with respect to being reprogrammed.
Sometimes, in the middle of the process, there will be no option but to reprogram a class that has already been programmed. I want my program to be able to choose a class that, if reprogrammed, affects the least possible number of other already-programmed classes. That would mean choosing a node in the graph that is “not very heavily linked”, subject to some constraints with respect to which nodes can be chosen.
EDIT: The question was… Do you know any algorithm that measures how “heavily linked” a node is?
No, but, I think that’s not as difficult as you think…
In your class you can simply create a “heaviness” field and an event that will be triggered at any change on any link that involves that class…
Therefore you just use the “get Max” algorithm using the “heaviness” property to compute.