>     DummyGraphDB .findPath(x, y, cb(err, path)) should return the labels along the edges from x to y
>   ․ DummyGraphDB .findPath(x, y, cb(err, path)) should return the labels along the edges from x to y
179a182,191
>     SimpleVersionGraph .recordTrans(v1, p, w, v2, cb(err)) should return a callback with no error if all is OK
>   ․ SimpleVersionGraph .recordTrans(v1, p, w, v2, cb(err)) should return a callback with no error if all is OK
>     SimpleVersionGraph .getMergeStrategy(v1, v2, cb(err, V1, x, V2)) should return x as the common ancestor of v1 and v2
>   ․ SimpleVersionGraph .getMergeStrategy(v1, v2, cb(err, V1, x, V2)) should return x as the common ancestor of v1 and v2
>     SimpleVersionGraph .getMergeStrategy(v1, v2, cb(err, V1, x, V2)) should return either v1 or v2 as V1, and the other as V2
>   ․ SimpleVersionGraph .getMergeStrategy(v1, v2, cb(err, V1, x, V2)) should return either v1 or v2 as V1, and the other as V2
>     SimpleVersionGraph .getMergeStrategy(v1, v2, cb(err, V1, x, V2)) should set V1 and V2 such that the path between x and V2 is lighter than from x to V1
>   ․ SimpleVersionGraph .getMergeStrategy(v1, v2, cb(err, V1, x, V2)) should set V1 and V2 such that the path between x and V2 is lighter than from x to V1
>     SimpleVersionGraph .getPatches(v1, v2, cb(err, patches)) should return the patches along the path between v1 and v2 (here, v1 is an ancestor of v2)
>   ․ SimpleVersionGraph .getPatches(v1, v2, cb(err, patches)) should return the patches along the path between v1 and v2 (here, v1 is an ancestor of v2)
231c243
<   114 passing (6s)
---
>   120 passing (5s)