Gurobi optimization for graphs by JavaFx

The task is to implement in Java to display gurobi results for 2-layer graphs. It is about 2-layer graphs K(m,n) where m and n are the amount of vertices on the layers. In these graphs we can draw gaps whenever two edges cross so that these graphs become more readable (see appended picture). In this picture if we look at the crossing from the edges g and h we can see that we assigned the gap here to edge h. Now this graph is 1-gap planar which means that each edge in the graph can have a maximum of 1 gap assigned to it. The task is to optimize the order of the vertices on the layers and the assignment of the gaps in Gurobi. A draft of Gurobi formulas is given in the chat. Please put word "I know Gurobi" at the first of bid. if not,will be ignored.