function updateNodesEdges()

in archive/src/app/GraphBuilder.js [235:277]

• 40 lines of code
• 13 McCabe index (conditional complexity)

function updateNodesEdges( graphs, leafSeqs ) {
  graphs.forEach( function(graph) {
    for( var i = 0; i < graph.nodes.length; i++ ) {
      graph.nodes[i].nid = i;
    }
  });
  var freqMax = 0, freqMin = 0;

  leafSeqs.forEach( function(seq) {
    if( graphs.indexOf(seq.graph) >= 0 ) {
      var words = seq.words;
//        printSeq(seq);
      for( var i = 0; i < words.length - 1; i++ ) {
        var linkadj = seq.graph.linkadj;
        if( !(words[i].nid in linkadj ) )
          linkadj[words[i].nid] = {};
        if( words[i+1].nid in linkadj[words[i].nid] )
          linkadj[words[i].nid][words[i+1].nid] += seq.size;
        else
          linkadj[words[i].nid][words[i+1].nid] = seq.size;

        if (freqMax == 0 && freqMin == 0) {
          freqMax = freqMin = words[i].freq;
        } else if (words[i].freq > freqMax) {
          freqMax = words[i].freq;
        } else if (words[i].freq < freqMin) {
          freqMin = words[i].freq;
        }
      }
      for( var i = 0; i < words.length; i++ ) {
        if( !words[i].leafSeq || words[i].leafSeq.size < seq.size )
          words[i].leafSeq = seq;
      }
    }
  });
  console.log(freqMax);
  graphs.forEach (function(graph){
    graph.graphsFreqMax = freqMax;
    graph.graphsFreqMin = freqMin;
  });

  return {graphsFreqMax: freqMax, graphsFreqMin: freqMin};
}