Results for hungarian-algorithm

Munkres (aka Hungarian) algorithm for JS

A lightweight and efficient implementation of the Munkres (Hungarian) algorithm for optimal assignment in square and rectangular matrices.

A hungarian algorithm that runs in O(n^3)

A hungarian algorithm that runs in O(n^3)

Munkres (aka Hungarian) algorithm for TS

Munkres (aka Hungarian) algorithm for JS

JWA implementation (supports all JWS algorithms)

Implementation of JSON Web Signatures

The Hungarian algorithm is an optimization algorithm that finds the optimal assignment of tasks to resources, minimizing the total cost or maximizing the total profit.

Interrupt-safe DOM morphing with spring physics, FLIP animations, Hungarian algorithm matching, and auto-animate via MutationObserver. Works with htmx, Alpine.js, Turbo, or vanilla JS.

Detect the indentation of code

Sniff the encoding from a HTML byte stream

Efficient implementation of Levenshtein algorithm with locale-specific collator support.

Simple “Least Recently Used” (LRU) cache

The fastest and smallest JavaScript polygon triangulation library for your WebGL apps

The lightest signal library.

Fast 2D concave hull algorithm in JavaScript (generates an outline of a point set)

An implementation of the Unicode Line Breaking Algorithm (UAX #14)

The fCoSE layout for Cytoscape.js by Bilkent with fast compound node placement

Parse a JSON string that has git merge conflicts, resolving if possible

Hashing made simple. Get the hash of a buffer/string/stream/file.

A JS library for finding optimal label position inside a polygon

A point in polygon based on the paper Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polygons

SHA1 wrapper for browsers that prefers `window.crypto.subtle`.