I am working on a software with a graphical interface in workflow mode that accept drag and drop of widgets, and creation of arrows between modules, to show where the data come from, and where they go.
Current challenge is to implement automatic arrangement of arrows: when an arrow is drawn, it should be right angle and avoid all other widgets, and also avoid crossing other arrows as much as possible. I assume an algorithm for minimal path finding in graph theory could be useful.
All that is implemented with C++ / Qt.
Did you face same issue, and do you have an more precise idea regarding a suitable algorithm?
Could you hint at some beneficial reference?
thanks and regards
this is a very intresting problem…i think the most easily applicable (and fun) method is:
Fruchterman: graph drawing by force directred placement