Socket
Socket
Sign inDemoInstall

strongly-connected-components

Package Overview
Dependencies
0
Maintainers
1
Versions
3
Alerts
File Explorer

Advanced tools

Install Socket

Detect and block malicious and high-risk dependencies

Install

    strongly-connected-components

Computes strongly connected components of a directed graph


Version published
Maintainers
1
Install size
5.61 kB
Created

Readme

Source

strongly-connected-components

Given a directed graph, splits it into strongly connected components.

Example

var scc = require("strongly-connected-components")

var edges = [
  [0,4],
  [1,0],
  [2,1],
  [2,3],
  [3,2],
  [4,1],
  [5,4],
  [5,6],
  [6,5],
  [6,2],
  [7,7],
  [7,6],
  [7,3]
]

console.log(scc(8, edges))

Install

npm install strongly-connected-components

API

require("strongly-connected-components")(numVertices, edges)

Computes the strongly connected components of a graph using Tarjan's algorithm.

  • numVertices is the number of vertices in the graph
  • edges is an array of pairs representing the directed edges of the graph

Returns An array of arrays representing the partitioning of the vertices in the graph into connected components.

Credits

(c) 2013 Mikola Lysenko. MIT License. Based on the implementation of Tarjan's algorithm on Wikipedia.

Keywords

FAQs

Last updated on 31 Oct 2013

Did you know?

Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.

Install

Related posts

SocketSocket SOC 2 Logo

Product

  • Package Alerts
  • Integrations
  • Docs
  • Pricing
  • FAQ
  • Roadmap

Stay in touch

Get open source security insights delivered straight into your inbox.


  • Terms
  • Privacy
  • Security

Made with ⚡️ by Socket Inc