#define false 0
#define true 1

/////////////////////
// local variables //
/////////////////////

var CurrentNode = 1; /* CurrentNode */ //current node
var NodeSkills[6]; /* NodeSkills */ //to store node skills
var NodeArray[100]; /* NodeArray */ //array for target nodes
var NodeAI = 0; /* NodeAI */ //índice for target nodes
var NodeAC = 0; /* NodeAC */ //counter for target nodes
var NodeAmount = 0; /* NodeAmount */ //number of nodes
var NodeCounter = 0; /* NodeCounter */ //counter for general use
var Nodelabels[100]; /* Nodelabels */ //array for node labels
var NodeTI = 0; /* NodeTI */ //índice for node labels
var NodeOrder[100]; /* NodeOrder */ //path order
var NodeOI = 0; /* NodeOI */ //índice for path order
var Fila[100]; /* Fila */ //FIFO array
var FilaI = 0; /* FilaI */ //índice for FIFO
var FilaC = 0; /* FilaC */ //counter for FIFO
var Edges = 0; /* Edges */ //number of edges

function busca_limpa() //Empty all variables
{
NodeCounter = 0;
while (NodeCounter <= NodeAmount)
{
Fila[NodeCounter] = 0;
Nodelabels[NodeCounter] = NodeAmount;
NodeOrder[NodeCounter] = 0;
NodeCounter += 1;
}
FilaI = 0;
FilaC = 0;
NodeCounter = 0;
NodeTI = 0;
NodeOI = 0;
}

function busca_largura(v) //label node v with 1 and put on the FIFO
{
Edges = 1;
while (Edges != 0)
{
CurrentNode = path_nextnode(my,v,Edges);
if (CurrentNode == 0)
{
Edges = 0;
}
else
{
if (Nodelabels[CurrentNode] > Nodelabels[v])
{
Nodelabels[CurrentNode] = Nodelabels[v] + 1;
FilaC += 1;
Fila[FilaC] = CurrentNode;
}
Edges += 1;
}
}
}

function busca_ordena() //feed an array with the order of the nodes that will be covered.
{
NodeAI = random(NodeAC); // int(random(NodeAC));
NodeOI = Nodelabels[NodeArray[NodeAI]];
NodeOrder[NodeOI] = NodeArray[NodeAI];
while (NodeOI > 1)
{
Edges = 1;
CurrentNode = 1;
while (CurrentNode != 0)
{
CurrentNode = path_nextnode(my,NodeOrder[NodeOI],Edges);
if (CurrentNode != 0 && (Nodelabels[CurrentNode] < NodeOI))
{
NodeOI -= 1;
NodeOrder[NodeOI] = CurrentNode;
CurrentNode = 0;
}
Edges +=1;
}
}
NodeOI = 1;
CurrentNode = NodeOrder[NodeOI];
}

function busca(w) //Set all nodes not marked and set all nodes with infinity value
{
busca_limpa();
Fila[FilaI] = w;
Nodelabels[w] = 1;
while (Fila[FilaI] != 0)
{
busca_largura(Fila[FilaI]);
FilaI += 1;
}
busca_ordena();
}

function busca_alvo(tipo) //function search the path entity and verifies which nodes is of a specific type (type = tipo)
{
NodeCounter = 0;
NodeAI = 0;
while (NodeCounter < 100)
{
NodeArray[NodeCounter] = 0;
NodeCounter += 1;
}
NodeCounter = 1;
while (NodeCounter <= NodeAmount)
{
path_getnode(my,NodeCounter,vector,NodeSkills);
//path_nodeskills(my,NodeCounter,NodeSkills);
if(NodeSkills[0] == tipo)
{
NodeArray[NodeAI] = NodeCounter;
NodeAI +=1;
}
NodeCounter += 1;
}
NodeAC = NodeAI;
NodeAI = 0;
NodeCounter = 0;
}