public void finalizeNetworkConstruction(){
  Set<MotifLink> keySet=nodeSetsDepartingFromLink.keySet();
  nodesWithLink=new HashMap<MotifLink,ArrayList<Node>>(keySet.size());
  for (  MotifLink motifLink : keySet) {
    Set<Node> nodes=nodeSetsDepartingFromLink.get(motifLink);
    ArrayList<Node> n=new ArrayList<Node>(nodes);
    Collections.sort(n);
    nodesWithLink.put(motifLink,n);
  }
  nodeSetsDepartingFromLink=null;
}

public void finalizeNetworkConstruction ( ) { Set < MotifLink > keySet = nodeSetsDepartingFromLink . keySet ( ) ; nodesWithLink = new HashMap < MotifLink , ArrayList < Node > > ( keySet . size ( ) ) ; for ( MotifLink motifLink : keySet ) { Set < Node > nodes = nodeSetsDepartingFromLink . get ( motifLink ) ; ArrayList < Node > n = new ArrayList < Node > ( nodes ) ; Collections . sort ( n ) ; nodesWithLink . put ( motifLink , n ) ; } nodeSetsDepartingFromLink = null ; }
optimises network structure for further processing
