Primitive GML Path finding logic

function Creature_findNode(nodeToSearchFrom,goal){
    var strand,strandLength,strands,referencedNode,referencedNodes,goalFound,creature;
    strands = 0;
    referencedNodes = 0;
    goalFound = 0;
    creature = id;
    searchNode(argument0,argument1);
    if (goalFound){
        var i;
        //transfer strand to pathPods list
        for(i=0;i<strandLength[ ##### ];i+=1){
            with(strand[i]){Pod_addPodToPath(creature);}
        }
    }
}

function Creature_FindNode_searchNode(nodeToSearchFrom,goal){
    var nodeToSearchFrom, goal, i;
    nodeToSearchFrom = argument0;
    goal = argument1;
    for(i=0;i<nodeToSearchFrom.pods;i+=1){
        if ( nodeToSearchFrom.pod[i] == goal ){
            goalFound = 1;
        }else{
            if ( PathFinding_isNodeReferenced(i) == -1 ){
                referencedNode[referencedNodes];
                referencedNodes+=1;
            }
        }
        if (goalFound){
            break;
        }
    }
}

function Creature_FindNode_isNodeReferenced( nodeToCheck ){
    var referenced,i;
    var nodeToCheck;
    nodeToCheck = argument0;
    referenced = -1;
    for(i=0;i<referencedNodes;i+=1){
        if (referencedNode[i] == nodeToCheck){
            referenced = i;
        }
    }
    return referenced;
}