find the subgraph between two nodes in a directed acyclic graph
Find the subgraph difference between two nodes in a directed acyclic graph.
Given a node
A the algorithm finds all nodes that are ancestors of
B but are not ancestors from
4-5-8-9 11-12/ \ \ / \1-2-3---6-7-10-13-14-15-16
var graphDiff = require'graph-difference'var nodes =1:2: 115: 12 1416: 15varcbnull nodesidgraphDiff5 7 readParents// result should be [7, 6, 3]