Doulbly-Connected Nodes

# Find Doulbly-Connected Nodes
~~~groovy
g.V().
  as("a").in().as("b").
  where("a", neq("b")).
  select("a", "b").
  groupCount("counts").
  filter { it.getSideEffects().get("counts").get(it.get()) == 2 }.
  dedup()
~~~

# Find Ancestors
~~~groovy
vertex.repeat(out()).emit().dedup()
~~~

# Count of Deepest Child
~~~groovy
vertex.repeat(__.in()).emit().path().toList().last().size()
~~~