Hi, I am building an educational chemistry application that involves many user interface (UI) objects that can be dragged about with the mouse. The UI objects can group or snap together when an object's 'group point' comes in contact with another group point of the same type.
>From this description, I can assemble a graph data structure of nodes. Each node has one or more group points and there are several types of group points. When two objects are connected they form an edge and the two group points that participate in that edge cannot be used until the edge is removed and the connection broken. So far so good. Now, with this data structure there are many operations I wish to perform such as highlight group points while an object is dragged. Explore the group points of a collection of objects that are being dragged together. I've thought about the problem extensively and come up with several implementation designs yet, I'm certain that there are some graph algorithms that would be appropriate for what I am trying to accomplish. Can anyone point me in the right direction? Perhaps some key words that I can use while searching? I have some algorithm text books and have been browsing but its hard to find a match between the abstract algorithms and the concrete applications or implementations. Thanks! --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
