Depth First Search in undirected Graph adjacency matrix

What is your hint or solution suggestion?

Challenge: Depth-First Search

Link to the challenge:

function notfound (r,i)

{

  let k = 0;

  for(k;k<r.length;++k)

  if(r[k]==i)

  return false

  return true;

}

function dfs(graph, root) {

  let r = [];

  let stack = [];

  stack.push(graph[root]);

  r.push(root);

  while(stack.length>0)

  {

      console.log("stack =",stack);

    for(let i = 0 ; i < graph[root].length; ++i)

    {

      if(notfound(r,i)&&stack[stack.length-1][i]==1)

      {

        stack.push(graph[i]);

        r.push(i);

        console.log("r =",r);

        i=0;

      }

    }

    console.log("poped",stack.pop(),"from stack");

  }

  console.log(r);

  return r;

}

Welcome, mynkpnwr.

Thank you, for your contribution. For future contributions, please wrap your solution within :

[details]
```
code goes here...
```
[/details]

Also, provide all of the necessary code to pass the challenge.

Also, when you enter a code block into a forum post, please precede it with a separate line of three backticks and follow it with a separate line of three backticks to make it easier to read.

You can also use the “preformatted text” tool in the editor ( </> ) to add backticks around text.

See this post to find the backtick on your keyboard.
Note: Backticks (`) are not single quotes (’).