Computes strongly connected components of a directed graph
npm install strongly-connected-componentsstrongly-connected-components
=============================
Given a directed graph, splits it into strongly connected components.
``javascript
var scc = require("strongly-connected-components")
var adjacencyList = [
[4], // 0
[0,2], // 1
[1,3], // 2
[2], // 3
[1], // 4
[4,6], // 5
[5,2], // 6
[7,6,3], // 7
]
console.log(scc(adjacencyList))
`
npm install strongly-connected-components
* adjacencyList is an array of lists representing the directed edges of the graph
Returns An object containing:
* components: an array of arrays representing the partitioning of the vertices in the graph into connected components.adjacencyList`: an array lists representing the directed edges of the directed acyclic graph between the strongly connected components
*