How to troubleshoot a SIGBUS error?

static var navpoints : GameObject[]; // all nav points

static var kLineOfSightCapsuleRadius = 0.1; //radius of line of sight capsule used to check neighboring status //var layerMask : LayerMask; //public var hitinfo: RaycastHit;

//var allWaypoints: GameObject[]; var neighborNodes: GameObject[]; //define neighbor array for each navpoint var neighborDistance: float[];

var previousNode: GameObject; var previousDist: float = Mathf.Infinity;

function Start() { navpoints = GameObject.FindGameObjectsWithTag(tagName); RebuildNavPointList();

}

function Awake () { navpoints = GameObject.FindGameObjectsWithTag(tagName); RebuildNavPointList(); }

@ContextMenu ("Update NavPoints") function UpdateNavPoints () { RebuildNavPointList(); }

// Draw the navpoint lines only when you select one of the navpoints function OnDrawGizmosSelected () { RebuildNavPointList();

 for (var p : GameObject in neighborNodes) 
 {

         Gizmos.color = Color.green;
         Gizmos.DrawLine (transform.position, p.transform.position);

 }

}

function RebuildNavPointList () { navpoints = GameObject.FindGameObjectsWithTag(tagName);

 for (var point : GameObject in navpoints) {
     (point.GetComponent(NavPoint) as NavPoint).RecalculateConnectedNavPoints();
 }

}

function OnDrawGizmos() { Gizmos.DrawIcon (transform.position, "waypoint.tif"); }

function RecalculateConnectedNavPoints () { var connected = new Array();

 for (var other : GameObject in navpoints) {
     // Don't connect to ourselves
     if (transform.position == other.transform.position)
         continue;

     // Do we have a clear line of sight?
     if (!Physics.CheckCapsule(transform.position, other.transform.position, kLineOfSightCapsuleRadius)) {
         connected.Add(other);
     }
 }

// neighborNodes = connected.ToBuiltin(GameObject);
// neighborDistance = new float[neighborNodes.length];

 for (i = 0; i < neighborNodes.length; i++)
 {
     neighborDistance[i] = Vector3.Distance(transform.position,neighborNodes[i].transform.position);
 }

var myWaypoints: GameObject[]; //all nodes var myPath: GameObject[]; var shortestPath: Array;

var nodes: Array;

var mySource: GameObject; var myTarget: GameObject;

function Start() { myWaypoints = GameObject.FindGameObjectsWithTag(tagName);

}

// All waypoints need to have the neighbors script attached, which stores neighborNodes/neighborDistance, and previousNode/previousDistance

function DijkstraPath(source: GameObject, target: GameObject, nodes: GameObject[]) {

 //initialize previousNode and previousDist values for each neighbor game object
 for (i = 0; i < nodes.length; i++)
 {   
     (nodes[i].GetComponent(NavPoint) as NavPoint).previousDist = Mathf.Infinity;
     (nodes[i].GetComponent(NavPoint) as NavPoint).previousNode = null;
 }


 //if the node is a source node it will get a previousDistance of 0

 (source.GetComponent(NavPoint) as NavPoint).previousDist = 0;

 //repeat until we visit every node in the graph and it is empty 
 while (nodes != null)
 {
     var bestNode: GameObject;
     var bestDistance: float = Mathf.Infinity;
     var bestIndex: int;


     for (i = 0; i < nodes.length; i++)
     {
         previousDistance = (nodes[i].GetComponent(NavPoint) as NavPoint).previousDist;

         //find node with smallest distance
         if (previousDistance < bestDistance)
         {
             bestDistance = previousDistance;  
             bestNode = nodes[i];
             bestIndex = i;
         }
     }   

     if (bestDistance == Mathf.Infinity) //only happens if there is no path to the source
     {
         break;
     }

     //remove this node from our list

     var nodeArray = new Array(nodes);
     nodeArray.RemoveAt(bestIndex);
     nodes = nodeArray.ToBuiltin(GameObject);

     var nlist = (bestNode.GetComponent(NavPoint) as NavPoint).neighborNodes;

     for (i = 0; i < nlist.length; i++)      
     {

         var neighborDist = (bestNode.GetComponent(NavPoint) as NavPoint).neighborDistance[i];
         var totalDistance = neighborDist + bestDistance;

         if (totalDistance < (nlist[i].GetComponent(NavPoint) as NavPoint).previousDist)
         {
             (nlist[i].GetComponent(NavPoint) as NavPoint).previousDist = totalDistance;
             (nlist[i].GetComponent(NavPoint) as NavPoint).previousNode = bestNode;

         }
     }   
 }

 if (target)
     var curNode: GameObject = target;

 var shortestPath = new Array();

 while ((curNode.GetComponent(NavPoint) as NavPoint).previousNode != null)
 {
     shortestPath.Add(curNode);
     curNode = (curNode.GetComponent(NavPoint) as NavPoint).previousNode;        
 }

 shortestPath.Add(source);
 shortestPath.Reverse();

 var testPath = shortestPath.ToBuiltin(GameObject);

 return testPath;

}

function Update() { myPath = DijkstraPath(mySource,myTarget,myWaypoints);