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: characteristics show clearly from the graph. Indeed, for a given number of vertices, the run time of the
  `connectedComponent()`-step does not depend on the number of edges, but rather on the maximum shortest path length in
  the graph.
  
  
  ==== Large graphs
  
  
negative.code: ----
  
  A straightforward way to detect the various subgraphs with an OLTP traversal is to do this:
  
  [gremlin-groovy,existing]
  ----
  g.V().emit(cyclicPath().or().not(both())).                                    <1>
  