"Fill - recursiv" - Processing

ID	Autor	Duplicat din	Ultima modificare
`#3453`	Candale Silviu (silviu)	Fill	Sambata, 07 dec 2019, 22:31

Programul umple patratelele verzi care sunt legate de primul patratel albastru.
Pentru a modifica, adaugati sau eliminati elemente din matricea A – 1 este patratel rosu, 0 este patratel verde
iStart si jStart sunt pozitiile patratelului albastru.
Plasati iStart si jStart pe un patratel initial verde!!!

var stack = [];
var n, m;
var di = [-1, 0, 1, 0];
var dj = [0, 1, 0, -1];

// MODIFY THIS //
var A=[
  [1,0,0,1,1,0,0],
  [0,1,0,1,0,1,0],
  [0,0,0,0,0,0,0],
  [1,0,1,0,1,0,1],
  [1,0,0,1,1,0,1],
  [1,0,0,0,0,0,0],
];
var iStart = 0, jStart = 1;
// TO THIS //

var dim = 25;

function setup() {
  	frameRate(2);
  	n = A.length;
  	m = A[0].length;
  	let d1 = Math.round(400 / (n + 1)) - 5;
  	let d2 = Math.round(400 / (m + 1)) - 5;
  	dim = d1;
  	if(d1 > d2)
      	dim = d2;
  	createCanvas(400, 400);
  	if(A[iStart][jStart] == 0)
    {
      stack.push([iStart, jStart,0]);
      A[iStart][jStart] = 2;
    }
}

function Desenare()
{
	for(var i = 0 ; i < n ; i ++)
      for(var j = 0 ; j < m ; j ++)
      {
        if(A[i][j] == 0)
          fill("lightgreen");
       	else if(A[i][j] == 1)
          fill("red");
        else if(A[i][j] == 2)
          fill("blue");
        else if(A[i][j] == 3)
          fill("lightblue");
		rect(dim + j*(dim + 5), dim + i*(dim + 5), dim , dim);
      }
}

function Inside(i,j)
{
  return i >=0 && i < n && j >= 0 && j < m;
}

function draw() {
  if(stack.length > 0)
  {
    let c = stack[stack.length - 1];
    console.log(c);
    if(c[2] >= 4)
    {
      A[c[0]][c[1]] = 3;
      stack.pop();
    }
    else
    {
      while(c[2] < 4 && (!Inside(c[0] + di[c[2]] , c[1] + dj[c[2]]) || A[c[0] + di[c[2]]][c[1] + dj[c[2]]] != 0))
      {
        stack[stack.length - 1][2] ++;
        c = stack[stack.length - 1];
      }
      if(c[2] < 4)
      {
        A[c[0] + di[c[2]]][c[1] + dj[c[2]]] = 2;
        stack.push([c[0] + di[c[2]], c[1] + dj[c[2]], 0]);
      }
      else
      {
        A[c[0]][c[1]] = 3;
        stack.pop();
      }   
    }
    Desenare();
  }
  else
  {
  	noLoop();
  }
}