Name	Size	Mode	Actions
index.d.ts	72	0666	editdlrm
index.js	1137	0666	editdlrm
index.js.flow	116	0666	editdlrm
LICENSE	1066	0666	editdlrm
package.json	120	0666	editdlrm
README.md	1100	0666	editdlrm

# `@rtsao/scc` Find strongly connected components of a directed graph using [Tarjan's algorithm](https://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm). This algorithm efficiently yields both a topological order and list of any cycles. ## Installation ``` yarn add @rtsao/scc ``` ``` npm install @rtsao/scc ``` ## Usage ```js const scc = require("@rtsao/scc"); const digraph = new Map([ ["a", new Set(["c", "d"])], ["b", new Set(["a"])], ["c", new Set(["b"])], ["d", new Set(["e"])], ["e", new Set()] ]); const components = scc(digraph); // [ Set { 'e' }, Set { 'd' }, Set { 'b', 'c', 'a' } ] ``` #### Illustration of example input digraph ``` ┌───┐ ┌───┐ │ d │ ◀── │ a │ ◀┐ └───┘ └───┘ │ │ │ │ ▼ ▼ │ ┌───┐ ┌───┐ │ │ e │ │ c │ │ └───┘ └───┘ │ │ │ ▼ │ ┌───┐ │ │ b │ ─┘ └───┘ ```