Search

union-find

A union-find data structure for maintaining disjoint sets.

v1.0.2 URL: https://unpkg.com/union-find@1.0.2/index.js

OpenBrowse Files

unionfindlinkdisjointsetconnectedcomponentgraph

@turf/boolean-disjoint

Checks if two geometries have no overlapping areas.

v7.3.0 URL: https://unpkg.com/@turf/boolean-disjoint@7.3.0/dist/cjs/index.cjs

OpenBrowse Files

turfdisjointbooleande-9im

merge-find

Implementation of Disjoint-set data structure algorithm (also called a union–find data structure or merge–find set).

v0.3.5 URL: https://unpkg.com/merge-find@0.3.5/dist/index.js

OpenBrowse Files

algorithmtypescriptalgorithmsdata-structuresunionmergedisjointdisjoint-setdisjoint-setsunion-findmerge-find

simplicial-disjoint-union

Concatenates two simplicial complexes

v0.0.0 URL: https://unpkg.com/simplicial-disjoint-union@0.0.0/union.js

OpenBrowse Files

concatenatemeshsimplicialcomplextrianglesurfaceuniondisjointjoininnercoproduct

set.prototype.isdisjointfrom

An ESnext spec-compliant `Set.prototype.isDisjointFrom` shim/polyfill/replacement that works as far down as ES3

v1.1.5 URL: https://unpkg.com/set.prototype.isdisjointfrom@1.1.5/index.js

OpenBrowse Files

javascriptecmascriptpolyfillshimSetSet.prototype.isDisjointFromisDisjointFromdisjointes-shim APIes-shims