title: Boost Graph Library: Is there a neat algorithm built into BGL for community detection?
body: <p>Anybody out there using BGL for large production servers?  </p>
  
  <ul>
  <li>How many node does your network consist of?  </li>
  <li>How do you handle <a href="http://en.wikipedia.org/wiki/Community_structure" rel="nofollow noreferrer">community detection</a>  </li>
  <li>Does BGL have any cool ways to detect communities?</li>
  <li>Sometimes two communities might be linked together by one or two edges, but these edges are not reliable and can fade away. Sometimes there are no edges at all.</li>
  </ul>
  
  <p>Could someone speak briefly on how to solve this problem.
  Please open my mind and inspire me.</p>
  
  <p>So far I have managed to work out if two nodes are on an island (in a community)
  in a lest expensive manner, but now I need to work out which two nodes on separate islands are closest to each other. We can only make minimal use of unreliable geographical data. </p>
  
  <p>If we figuratively compare it to a mainland and an island and take it out of social distance context. I want to work out which two bits of land are the closest together across a body of water.</p>