title: C# Vertex Edges
body: <p>I have a problem making this task: An n-vertex graph is a scorpion if it has a vertex  1(the sting) connected to a vertex  two (the tail) connected a vertex 3 (the body) connected to the other vertexes (the feet). Some of the feet may be connected to other feet. Design an algorithm that decides whether a given drawing represents a scorpion and tell in which line is sting,tail , body and feets. 
  This is my data file to read from:
  <a href="http://i.stack.imgur.com/F0wiW.png" rel="nofollow">(+) is where is edge and (-) where are no edges</a></p>
  
  <p>I'm trying to find the sting first but how basically i could search for connections with tail and body? <em>also i have to use recursion</em>
  <strong>EDIT:</strong>
  Ok now i habe found how much "+" there are in each line:</p>
  
  <pre><code>int[] B = new int[100];
         for (int i = 0; i &lt; n; i++)
         {
             for (int j = 0; j &lt; n; j++)
             {
                 int HowMuch = Regex.Matches(A[i,j], @"\+").Count;
                 Saving[i] += HowMuch;
             }
             if(Saving[i]&gt;=3)
             {
                 Console.WriteLine("It's a scorpion!");
                 Console.WriteLine("The body is in: " + i + " part");
             }
         }
  </code></pre>
  
  <p><em>And with recursion i'm trying to find path connections... How i should continue?</em></p>
  
  <pre><code>static void Find(string[,] A, int n, int j)
      {
          for (int i = 0; i &lt; n; i++)
          {
              if(A[i,j]=="+")
              {
                  j = i;
                  Find(A, n, j);
              }
          }
  
      }
  </code></pre>