y3

For edge crossing reduction, I read about algorithms that swap adjacent nodes to progressively reduce edge crossings. Then, I read about a way of doing it with integer programming, which I did not get at all. To my relief, the section after that in the book said that people usually use adjacent exchange, so hopefully, that works out for me.