UNPKG

path-scc

Version:

Find all strongly-connected components in a graph structure.

26 lines (25 loc) 500 B
{ "name": "path-scc", "version": "1.0.2", "description": "Find all strongly-connected components in a graph structure.", "repository": { "type": "git", "url": "git@github.com:jdiehl/path-scc.git" }, "main": "scc.js", "types": "scc.d.ts", "scripts": { "build": "tsc" }, "keywords": [ "scc", "strongly connected components", "cycles", "graph" ], "author": "Jonathan Diehl", "license": "MIT", "devDependencies": { "typescript": "^2.4.2" } }