Answers are grounded in this paper and cite their sources.
We describe a three-pass algorithm for improving the readability of Forrester Diagram in system dynamics. The first pass converts Forrester Diagram to recurrent hierarchy. The second pass sorts the vertices on each level, with the goal of minimizing crossings. The third pass is a finite tuning of the layout that determines the horizontal positions of vertices. An illustrative example is given to verify the result. .
No takes yet. Share an insight, caveat, or question.
Yang et al. (2003) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: