|
@@ -63,6 +63,11 @@ public class ConflictDetection implements AlgorithmStage {
|
|
actions.add( 0, ()->{
|
|
actions.add( 0, ()->{
|
|
i = oldI;
|
|
i = oldI;
|
|
l1 = oldL1;
|
|
l1 = oldL1;
|
|
|
|
+ if( i + 1 < graph.getContainedLayers().size() - 1 && l1 > 0 )
|
|
|
|
+ {
|
|
|
|
+ LayeredGraphNode layde = graph.getContainedLayers().get( i + 1 ).get( l1 - 1 );
|
|
|
|
+ layde.setSelected( null );
|
|
|
|
+ }
|
|
for( LayeredGraphEdge c : conflicts )
|
|
for( LayeredGraphEdge c : conflicts )
|
|
c.setConflicted( false, null );
|
|
c.setConflicted( false, null );
|
|
});
|
|
});
|