![Namecheap Takes Down Polyfill.io Service Following Supply Chain Attack](https://cdn.sanity.io/images/cgdhsj6q/production/6af25114feaaac7179b18127c83327568ff592d1-1024x1024.webp?w=800&fit=max&auto=format)
Security News
Namecheap Takes Down Polyfill.io Service Following Supply Chain Attack
Polyfill.io has been serving malware for months via its CDN, after the project's open source maintainer sold the service to a company based in China.
union-find
Advanced tools
Readme
A basic union-find data structure for node.js. For more information, see wikipdia:
Union find data structures solve the incremental connectivity problem. (That is maintaining a spanning forest under incremental insertions of edges.) To handle fully dynamic connectivity, you can use a dynamic forest data structure.
Here is an example showing how to do connected component labelling. Assume we are given a graph with VERTEX_COUNT
vertices and a list of edges stored in array represented by pairs of vertex indices:
//Import data structure
var UnionFind = require('union-find')
var VERTEX_COUNT = 8
var edges = [
[0,1],
[1,2],
[2,3],
[5,6],
[7,1]
]
//Link all the nodes together
var forest = new UnionFind(VERTEX_COUNT)
for(var i=0; i<edges.length; ++i) {
forest.link(edges[i][0], edges[i][1])
}
//Label components
var labels = new Array(VERTEX_COUNT)
for(var i=0; i<VERTEX_COUNT; ++i) {
labels[i] = forest.find(i)
}
npm install union-find
var UnionFind = require('union-find')
var forest = new UnionFind(numVertices)
Creates a new union-find data structure.
numVertices
is the number of vertices in the graphReturns A new union-find data structure
forest.length
Returns the number of vertices in the forest
forest.makeSet()
Creates a new vertex
Returns An integer id for the new vertex
forest.find(v)
Returns an identifier representing the connected component of any given vertex
Returns An integer id representing the connected component of v
forest.link(s, t)
Links a pair of connected components together
s
and t
are both vertices(c) 2013-2014 Mikola Lysenko. MIT License
FAQs
A union-find data structure for maintaining disjoint sets.
The npm package union-find receives a total of 68,181 weekly downloads. As such, union-find popularity was classified as popular.
We found that union-find demonstrated a not healthy version release cadence and project activity because the last version was released a year ago. It has 1 open source maintainer collaborating on the project.
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.
Security News
Polyfill.io has been serving malware for months via its CDN, after the project's open source maintainer sold the service to a company based in China.
Security News
OpenSSF is warning open source maintainers to stay vigilant against reputation farming on GitHub, where users artificially inflate their status by manipulating interactions on closed issues and PRs.
Security News
A JavaScript library maintainer is under fire after merging a controversial PR to support legacy versions of Node.js.