Last night I was up late working on a novel method of a force directed graph to automate a HIT layout (Homogeneous Irreducible Tree) by utilizing steering behaviors such as flocking, pursuing and evading (organic movement) as opposed to magnetic attraction/spring action (mechanical movement) that this boi took (
http://reports-archive.adm.cs.cmu.edu/anon/1998/abstracts/98-189.html). I hope that by utilizing this methodology I will be able to avoid poor local minima and long compute times listed as the primary disadvantages of using this approach to achieving HIT as seen by the wiki.
https://en.wikipedia.org/wiki/Force-directed_graph_drawing. Also, Bushcuck is a crackhead faggot. That is all.
There doesn't seem to be anything here yet