anchor.diff:  explore additional relationships in the data. Each level of nesting is
   considered a _hop_, and proximity within the graph is often described in
   terms of _hop depth_.
  -
  ++
  +.Properties for `connections`
  +[%collapsible%open]
  +======
   query:::
   An optional _guiding query_ that constrains the Graph API as it
   explores connected terms. For example, you might want to direct the Graph
  
positive.code: 
  The default settings are configured to remove noisy data and
  get the "big picture" from your data. This example shows how to specify
  additional parameters to influence how the graph is built. 
  
  For tips on tuning the settings for more detailed forensic evaluation where
  every document could be of interest, see the
  
negative.code: <1> The vertices you want to start from are specified
  as an array of terms in an `include` clause.
  <2> The `exclude` clause prevents terms you already know about from being
  included in the results.
  