Probably because you are letting the buttons go to trigger the eventTry keeping the right button pressed while releasing the left one (after causing LMB to start the drag).
Probably because you are letting the buttons go to trigger the eventTry keeping the right button pressed while releasing the left one (after causing LMB to start the drag).
Aha, that works. Ta very much.
Bit counter intuitive, but it's just to demonstrate a presentation idea about trees so it's never going to be really used.
Also if you happen to know where to find the Fructherman-Reingold algorithm or Kamada-Kawai anywhere let me know! I can only find vague descriptions of the algorithms and I need something to space out the different nodes properly.
You might want to use "drop actions" instead. There are three such actions -- copy, move and link. You can use them for whatever you want (with copy being the default and two others being triggered by holding ctrl or alt). It might prove simpler.Originally Posted by Zephro
They are available in the boost library. But prepare for a template ride:Originally Posted by Zephro
http://www.boost.org/libs/graph/doc/
I already tried them and did not manage to parameterize them correctly so my results where somehow useless. Do you know some good documentation for these algorithms?
No idea, I just want a simple description, but detailed enough, so I can implement it myself rather than dealing with templates.
Especially as my data structures I'm working on probably won't work very well. ¬_¬
Last edited by Zephro; 24th February 2006 at 16:10.
Bookmarks