<   ․ Neo4jGraphDB as GraphDB addEdge should accept an edge and add it to the graph
<     Neo4jGraphDB as GraphDB addEdge should create a dual mapping, mapping also the destination to the source
<   ․ Neo4jGraphDB as GraphDB addEdge should create a dual mapping, mapping also the destination to the source
<     Neo4jGraphDB as GraphDB findCommonAncestor should find the common ancestor of two nodes, and the path to each of them
<   ․ Neo4jGraphDB as GraphDB findCommonAncestor should find the common ancestor of two nodes, and the path to each of them
<     Neo4jGraphDB as GraphDB findCommonAncestor should handle the case where there are also common descendants
<   ․ Neo4jGraphDB as GraphDB findCommonAncestor should handle the case where there are also common descendants
<     Neo4jGraphDB as GraphDB findCommonAncestor should return the path from the common ancestor to both nodes
<   ․ Neo4jGraphDB as GraphDB findCommonAncestor should return the path from the common ancestor to both nodes
<     Neo4jGraphDB .findPath(x, y, cb(err, path)) should return the labels along the edges from x to y
<   ․ Neo4jGraphDB .findPath(x, y, cb(err, path)) should return the labels along the edges from x to y
<     Neo4jGraphDB .findPath(x, y, cb(err, path)) should always take the shortest path
<   ․ Neo4jGraphDB .findPath(x, y, cb(err, path)) should always take the shortest path
<     Neo4jGraphDB .findPath(x, y, cb(err, path)) should handle directed cycles correctly
<   ․ Neo4jGraphDB .findPath(x, y, cb(err, path)) should handle directed cycles correctly
---
>   1) Neo4jGraphDB "before each" hook
65a52,53
>     BucketObjectStorage .storeVersion(ctx, v1, p, monitor, r, eff) should recursively copy all reachable objects in the current bucket to the new one
>   ․ BucketObjectStorage .storeVersion(ctx, v1, p, monitor, r, eff) should recursively copy all reachable objects in the current bucket to the new one
333c321
<   165 passing (7s)
---
>   158 passing (388ms)