title: Finding the largest connected component in an adj matrix graph?
body: <p>I'm trying to find out it there is a way of finding the largest connected component in a adj matrix graph. Such as this:</p>
  
  <pre><code>0000000110
  0001100000
  0000000000
  0100000010
  0100000100
  0000000100
  0000000000
  1000110000
  1001000000
  0000000000
  </code></pre>
  
  <p>I've Google'd the problem and am struggling to find anything, I've also read though the wiki article on graph theory and no joy. I assume their must be an algorithm out there to solve this problem. Can anybody point me in the right direction and give me some pointers on what I should be doing to solve this myself?</p>