A directed graph with 48 nodes (precedence diagram) is drawn using the sugiyama layouting algorithm. A hillclimbing algorithm is applied to reduce the crossings between nodes (which is not the best choice as it produces local minimas sometimes [see video]; future versions will use a genetic algorithm for better results). View it at 480p and full screen (sorry for the narrow vid).
Link to this comment:
All Comments (0)