union-find

WebJar for union-find

License	MIT
GroupId	org.webjars.npm
ArtifactId	union-find
Last Version	1.0.2
Release Date	Mar 10, 2018
Type	jar
Description	union-find WebJar for union-find
Project URL	http://webjars.org
Source Code Management	https://github.com/mikolalysenko/union-find

Download union-find

Filename	Size
union-find-1.0.2.pom
union-find-1.0.2.jar	6 KB
union-find-1.0.2-sources.jar	22 bytes
union-find-1.0.2-javadoc.jar	22 bytes

How to add to project

Apache Maven

<!-- https://jarcasting.com/artifacts/org.webjars.npm/union-find/ -->
<dependency>
    <groupId>org.webjars.npm</groupId>
    <artifactId>union-find</artifactId>
    <version>1.0.2</version>
</dependency>

Gradle Groovy

// https://jarcasting.com/artifacts/org.webjars.npm/union-find/
implementation 'org.webjars.npm:union-find:1.0.2'

Gradle Kotlin

// https://jarcasting.com/artifacts/org.webjars.npm/union-find/
implementation ("org.webjars.npm:union-find:1.0.2")

Apache Buildr

'org.webjars.npm:union-find:jar:1.0.2'

Apache Ivy

<dependency org="org.webjars.npm" name="union-find" rev="1.0.2">
  <artifact name="union-find" type="jar" />
</dependency>

Groovy Grape

@Grapes(
@Grab(group='org.webjars.npm', module='union-find', version='1.0.2')
)

Scala SBT

libraryDependencies += "org.webjars.npm" % "union-find" % "1.0.2"

Leiningen

[org.webjars.npm/union-find "1.0.2"]

Dependencies

There are no dependencies for this project. It is a standalone project that does not depend on any other jars.

Project Modules

There are no modules declared in this project.

union-find

A basic union-find data structure for node.js. For more information, see wikipdia:

Disjoint Set Datastructures

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.

Usage

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)
}

Installation

npm install union-find

API

var UnionFind = require('union-find')

Constructor

var forest = new UnionFind(numVertices)

Creates a new union-find data structure.

• numVertices is the number of vertices in the graph

Returns A new union-find data structure

Methods

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

Credits

(c) 2013-2014 Mikola Lysenko. MIT License

Versions

Version
1.0.2 Mar 10, 2018