As I promised yesterday in my first post about drawing DAG's, today I’ll describe a big part of the “nice-looking” graph layout algorithm. It’s very simple and it’s described in the following video:
If you are reading this blog from a feed, click the link to the real post to see the video
- at 9:46 I said the result with iterating by the topological sorting would be uglier - I meant prettier...
- I somehow switched the image of the best result from the graph… Here is the Correct Image Result