graph-difference

graph-difference.js

Minimal JavaScript/TypeScript library for directed acyclic graphs (DAGs).
Finds the subgraph difference between two nodes: all ancestors of to that are not ancestors of from.

Install

npm install graph-difference.js

Usage

ES Module (JavaScript / TypeScript)

import graphDiff from 'graph-difference.js'

const nodes = {
  1: [],
  2: [1],
  /* ... */
  20: [19]
}

const readParents = (id, cb) => {
  // async fetch of parent IDs
  cb(null, nodes[id] || [])
}

graphDiff(5, 7, readParents, (err, result) => {
  console.log(result) // [7, 6, 3]
})

CommonJS

const graphDiff = require('graph-difference.js')

API

function graphDiff<T>(
  from: T | null,
  to: T,
  readParents: (
    id: T | null,
    cb: (err: Error | null, parents?: (T | null)[]) => void
  ) => void,
  cb: (err: Error | null, res?: (T | null)[]) => void
): void

export default graphDiff

• from: starting node ID (or null)
• to: target node ID
• readParents: callback to fetch parent IDs of a node
• cb: callback with error or array of node IDs in difference

Example

import graphDiff from 'graph-difference.js'

const nodes = { A: [], B: ['A'], C: ['A'], D: ['B','C'] }
const readParents = (id, cb) => cb(null, nodes[id] || [])

graphDiff('B', 'D', readParents, (_, diff) => {
  // ancestors of D: ['D','B','C','A'], 
  // ancestors of B: ['B','A'], 
  // difference: ['D','C']
  console.log(diff) // [ 'D', 'C' ]
})

Testing

Run the suite with:

npm test

TypeScript Support

Built with an included index.d.ts — no extra typings needed.

License

MIT