Hmm, I don't think you can adapt this algorithm for minimal edge crossing. It wasn't designed with that in mind. Like I said at the beginning of this thread, graph drawing is an entire discipline to itself, and still the subject of research. The holy grail of a fast algorithm that lays out a graph in minimal size, with minimal edge crossing, and minimal edit instability (when you add or remove nodes) doesn't exist. Maybe it can't even be made (humans can't do that either). If it interests you then you can keep learning about it almost indefinitely (there are yearly conferences about graph drawing where all the research results are reported).