REPLY TO COMMENT


Daniel
The "software that automatically rebuilds the charts as you connect nodes" is performing a topological sorting for you, see http://en.wikipedia.org/wiki/Topological_sorting. Such a sorting exists if and only if the dependencies form a directed acyclic graph.  Of course the actually interesting part is then drawing the graph: http://en.wikipedia.org/wiki/Layered_graph_drawing.