I came up with a recursive layout (ie graph drawing) algorithm for directed acyclic graphs (DAGs). I was trying to draw program flowcharts and the hierarchical layout graphvis creates are very ugly and unbalanced. If you reverse the back edges of while and for loops a flowchart is a DAG. I did a python implementation.
I research graph drawing for a while and the closest algorithm to mine was a “delta drawing”, I also found a paper about delta with force reduction steps.
Then I stopped working on program static analysis and didn’t do anything with it.
> If you reverse the back edges of while and for loops a flowchart is a DAG.
Depending on language there could be also end recursions that never return or - the horror- GOTOs.
I research graph drawing for a while and the closest algorithm to mine was a “delta drawing”, I also found a paper about delta with force reduction steps.
Then I stopped working on program static analysis and didn’t do anything with it.