Community
Participate
Working Groups
A new step in the graph layout has been added called RouteEdges. This reuses the ShortestPathRouter algorithm. The problem is the calculation of neighboring obstacles is not correct in a compound graph. To see the problem run the CompoundGraphDemo and look at the initial test graph.