<div>
HI, 
 
I'm not sure we can help without seeing the code for the verticeGrapho object and more explanation about the variables used, but something in the call must make the tmp.info member = 0. otherwise you would never come out of the recursive loop. what does tmp.next do? 
 
BB
</div>

HI,

I'm not sure we can help without seeing the code for the verticeGrapho object and more explanation about the variables used, but something in the call must make the tmp.info member = 0. otherwise you would never come out of the recursive loop. what does tmp.next do?

BB

<div>
<div class="content wysiwyg-content">
hi, when you have a recursive function that works like this: 
 
call 1 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; i=1 
call 2 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;i=2 
call 3 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; i=3 
call 4 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; 3 
call 5 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;2 
call 6 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;1 
 
I can get the value of i until the 3, but then it began to decrese, how could I avoid that? because the next value I need is i=4. 
 
this is my function: 
 
public void DFS(verticeGrapho tmp, int i, int j, int n, int[,] ma, int g) 
{ 
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; tmp.info = i; 
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; i++; 
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for (int k = g; k &lt;= n; k++) 
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; { 
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (ma[j, k] == 1 &amp;&amp;&nbsp;tmp.info == 0) 
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; { 
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; DFS(tmp, i, g, n, ma, g); 
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; } 
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; tmp = tmp.next; g++; 
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; } 
} 
 
Hope you understand my question!!! 
 
Thanks!!! 
 

</div>
</div>

hi, when you have a recursive function that works like this:

call 1 i=1
call 2 i=2
call 3 i=3
call 4 3
call 5 2
call 6 1

I can get the value of i until the 3, but then it began to decrese, how could I avoid that? because the next value I need is i=4.

this is my function:

public void DFS(verticeGrapho tmp, int i, int j, int n, int[,] ma, int g)
{
 tmp.info = i;
 i++; 
 for (int k = g; k <= n; k++)
 {
 if (ma[j, k] == 1 && tmp.info == 0)
 {
 DFS(tmp, i, g, n, ma, g);
 }
 tmp = tmp.next; g++;
 }
}

Hope you understand my question!!!

Thanks!!!

recursion

C# is an object-oriented programming language created in conjunction with Microsoft’s .NET framework. Compilation is usually done into the Microsoft Intermediate Language (MSIL), which is then JIT-compiled to native code (and cached) during execution in the Common Language Runtime (CLR).