A couple of weeks ago, I started trying to understand the
Coffman-Graham algorithm, which is not that complex of an algorithm, but the academic language and math notation was really hard for me to grasp. I needed it because the endeavor tree view in this app would end up spawlingly wide in many cases, and Coffman-Graham works out a way for a tree graph to have a limited width.
I think I've implemented it correctly, but I gave up temporarily on my previous layout algorithm's avoidance of edge crossing. So, it looks horrifically unreadable right now. But this is still a step forward.
A couple of weeks ago, I started trying to understand the Coffman-Graham algorithm, which is not that complex of an algorithm, but the academic language and math notation was really hard for me to grasp. I needed it because the endeavor tree view in this app would end up spawlingly wide in many cases, and Coffman-Graham works out a way for a tree graph to have a limited width.