This is great.<p>It's beautiful, and you've explained the field of tidy tree generation really well.<p>I wish I had this to refer to last year when implementing something similar in VBA for Excel and PowerPoint [1]. Perhaps it's time for me to revisit!<p>[1] <a href="https://aaronbrooker.com/vdttool" rel="nofollow">https://aaronbrooker.com/vdttool</a>
Beautiful and impressively fast! I wonder if this could be adapted to work with [1] “dot” graphs through the terminal?<p>[1] <a href="https://graphviz.org/doc/info/command.html" rel="nofollow">https://graphviz.org/doc/info/command.html</a>
@czx111331 - based on your new algo, how much cognitive improvement do you think would be possible on website trees like this one:
<a href="https://app.visualsitemaps.com/share/5649338316a9b89f00ef617029f592b0" rel="nofollow">https://app.visualsitemaps.com/share/5649338316a9b89f00ef617...</a><p>here's the Json: <a href="https://gist.github.com/visualsitemaps/94f88f1ffadea91204eb23a665f152a3" rel="nofollow">https://gist.github.com/visualsitemaps/94f88f1ffadea91204eb2...</a>
Does everyone else feel like optimal/efficient algorithms are _significantly_ easier to intuit once you know the achievable complexity? My initial guess was that this algorithm would be n log n, but once I read that the solution space was linear, I instantly came up with some linear approaches.