anchor.diff:  
   	}
   
  -
   	// Add lines
   	for(var key in weightedNodes){	
   		var node = weightedNodes[key];
  
positive.code: 		}
  	}
  
  	var currentSortOrder = 0;
  	var yPos = 40;
  	for(var i = 0; i < sortedNodeNames.length; i++){
  		// how many same sort order there are?
  
negative.code: 	Joint.paper("myfsa1", PAPER_WITH, 1000);
  	var fsa = Joint.dia.fsa;
  
  	weightedNodes["start"] = { to : [ res.start.to] };
  
  	for(var i = 0; i < res.decisionOrForkOrJoin.length; i++){
  //		var circle = fsa.State.create({ position: {x: 200, y: yPos}, label: res.decisionOrForkOrJoin[i].name });
  //		if(res.decisionOrForkOrJoin[i].java !=null){
  //			var java = res.decisionOrForkOrJoin[i].java;
  //		}
  
  		// kill does not have ok and error
  		if(res.decisionOrForkOrJoin[i].ok === undefined && res.decisionOrForkOrJoin[i].error === undefined){
  			weightedNodes[res.decisionOrForkOrJoin[i].name] = { to : [] };
  		}else{
  			weightedNodes[res.decisionOrForkOrJoin[i].name] = { to : [res.decisionOrForkOrJoin[i].ok.to, res.decisionOrForkOrJoin[i].error.to] };
  		}
  
  	}
  
  
  	weightedNodes[res.end.name] = { to : [] };
  
  	addSortOrderToWeightedNodes("start", 0);
  
  	// Invert the index TODO pretty bad logic.
  	var sortedNodeNames = [];
  