anchor.diff:  
   3. Large graphs requiring an approach with `HadoopGraph` and `SparkGraphComputer` to yield results in a reasonable time.
   
  -
   These regimes are discussed separately using the following graph with three weakly connected components:
   
   image:connected-components.png[width=600]
  
positive.code: pure depth-first-search or breadth-first-search implementations, connected-component algotithms should scale
  as [.big]##O##(V+E). For the traversals in the figure above this is almost the case.
  
  
  [[cc-scale-ratio]]
  .Run times for finding connected components in a randomly generated graph with 10 components, each consisting of 6400 vertices
  image::cc-scale-ratio.png[width=600]
  
negative.code: 
  <5> The values of the groupby map contain the lists of vertices making up the requested components.
  
  ==== Small graph scalability
  
  The scalability of the OLTP traversal and the `connectedComponent()`-step for in-memory graphs is shown in the figures
  