Weighted Packages

Graph data structure.

Configurable, flexible, and overall great random number and data generator library.

Various UMD builds of a great random number and data generator library.

Horizontal tree with weights and click functionality and data configuration. This chart takes maximum number of children to be shown,all other values will be clubbed together and shown as others.

Relation Rank

Locally-weighted polynomial regression via the LOWESS algorithm.

Compute an exponentially weighted mean incrementally.

Compute an exponentially weighted standard deviation incrementally.

Compute an exponentially weighted variance incrementally.

Compute a weighted arithmetic mean incrementally.

Weighted list implementation, pick random item using probability distribution

KombiN is an algorithm to get index for combination pair and to get combination pair from index, where all possible combination pairs from two finite sets are sorted by their weight in ascending order.

KombiN is an algorithm to get index for combination pair and to get combination pair from index, where all possible combination pairs from two finite sets are sorted by their weight in ascending order.

Immutable Graph data structures for TypeScript

Immutable Graph data structures for TypeScript

Immutable Graph data structures for TypeScript

Various weighted average functions

The library calculates weighted mean.

A TypeScript library for weighted random item selection

Directed Graph