title: edge connectivity graph
body: <p>I need help with a pseudocode for an algorithm that solves the 3-edge connectivity problem:
  input: a graph G in adjacency matrix format</p>
  
  <p>output: true if, for every pair of vertices v,w elements of G, there exists a path from v to w of length at most 3</p>
  
  <p>Any Ideas? This is what I have so far. </p>
  
  <pre><code>const int WIDTH = 10;
  const HIGHT =10;
  Int arrayMatrix [WIDTH] [HIGHT];
  
  for (int i =0; i&lt; WIDTH; i++)
  {
  for (int j =0; j&lt;HIGHT; j++)
  {
  int countEdges =0;
  countEdges = countEdges +arrayMatrix [i];
  }
  if countEdges&lt;=3
  cout &lt;&lt; "True for 3-edge connectivity problem" &lt;&lt; endl;
  else 
  cout &lt;&lt;"Not found" &lt;&lt; enld;
  </code></pre>