Minimum cut problem for JavaScript
A library for obtaining browser versions with their maximum supported Baseline feature set and Widely Available status.
graph algorithm
Simple “Least Recently Used” (LRU) cache
JWA implementation (supports all JWS algorithms)
The lightest signal library.
The fCoSE layout for Cytoscape.js by Bilkent with fast compound node placement
Implementation of JSON Web Signatures
UnRS Resolver Node API
A graph data structure with topological sort.
JSON Web Token implementation (symmetric and asymmetric)
Solves minimum-cost flow problems using the successive shortest paths algorithm
Miscellaneous indices for graphology.
[](https://travis-ci.org/tmont/tarjan-graph) [](https://www.npmjs.com/package/tarjan-graph)
Find strongly connected components of a directed graph using [Tarjan's algorithm](https://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm).
Force directed graph drawing layout
Simple force-directed layout algorithm for graphology.
Browser Compatible Object Hashing
Implementation of the Graham Scan algorithm to calculate a convex hull from a given array of x, y coordinates.
Finds all elementary circuits of a directed graph using Johnson's algorithm (1975)
Implementation of Kruskal's algorithm for finding a minimum spanning forest of an unidirected edge-weighted graph.
Easily create highly customizable particle animations and use them as animated backgrounds for your website. Ready to use components available also for React, Vue.js (2.x and 3.x), Angular, Svelte, jQuery, Preact, Riot.js, Inferno.
ForceAtlas 2 layout algorithm for graphology.
Derivative of whatwg-url without unicode handling and optimized for Expo