graph-difference
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 node B
but are not ancestors from node A
.
Example
The graph:
4-5-8-9 11-12
/ \ \ / \
1-2-3---6-7-10-13-14-15-16
var graphDiff =var nodes =1:2: 1...15: 12 1416: 15var {}