|
@@ -182,6 +182,9 @@ public class BlockCalc {
|
|
LayeredGraphEdge e = m.<LayeredGraphNode>read( "graph", MemoryType.LOCAL ).findEdgeBetween(
|
|
LayeredGraphEdge e = m.<LayeredGraphNode>read( "graph", MemoryType.LOCAL ).findEdgeBetween(
|
|
m.<ArrayList<LayeredGraphNode>>read( "neighbors", MemoryType.LOCAL ).get( m.read( "m", MemoryType.LOCAL ) ),
|
|
m.<ArrayList<LayeredGraphNode>>read( "neighbors", MemoryType.LOCAL ).get( m.read( "m", MemoryType.LOCAL ) ),
|
|
m.read( "n", MemoryType.LOCAL ) );
|
|
m.read( "n", MemoryType.LOCAL ) );
|
|
|
|
+ if( e == null )
|
|
|
|
+ e = m.<LayeredGraphNode>read( "graph", MemoryType.LOCAL ).findEdgeBetween( m.read( "n", MemoryType.LOCAL ),
|
|
|
|
+ m.<ArrayList<LayeredGraphNode>>read( "neighbors", MemoryType.LOCAL ).get( m.read( "m", MemoryType.LOCAL ) ) );
|
|
ArrayList<LayeredGraphNode> layerBefore;
|
|
ArrayList<LayeredGraphNode> layerBefore;
|
|
if( m.<String>read( "layout", MemoryType.LOCAL ).contains( "DOWN" ) )
|
|
if( m.<String>read( "layout", MemoryType.LOCAL ).contains( "DOWN" ) )
|
|
layerBefore = m.<ArrayList<ArrayList<LayeredGraphNode>>>read( "L", MemoryType.LOCAL ).get( m.<Integer>read( "i", MemoryType.LOCAL ) - 1 );
|
|
layerBefore = m.<ArrayList<ArrayList<LayeredGraphNode>>>read( "L", MemoryType.LOCAL ).get( m.<Integer>read( "i", MemoryType.LOCAL ) - 1 );
|