23 packages found

M
Q
P

Description

A practical, root-focused JavaScript polynomial utility library.

Keywords

Publisher

published 4.0.23 months ago
M
Q
P

Description

Graph data structure with path finding and traversing algorithms

Keywords

Publisher

published 0.1.9a year ago
M
Q
P

Description

A simple implementation of A* Pathfinding algorithm for sensory type ninjas.

Keywords

Publisher

published 0.1.13 months ago
M
Q
P

Description

Numerically compute the extrema of a given (analytic) function: minima, maxima, and points of inflection

Keywords

Publisher

published 1.0.02 years ago
M
Q
P

Description

compute MIN of two intervals

Keywords

Publisher

published 1.0.05 years ago
M
Q
P

Description

compute the MAX interval of two intervals

Keywords

Publisher

published 1.0.06 years ago
M
Q
P

Description

Floating point binary search

Keywords

Publisher

published 1.0.06 years ago
M
Q
P

Description

cli finding differences

Keywords

Publisher

published 0.0.162 years ago
M
Q
P

Description

mineflayer plugin which adds 3d pathfinding

Keywords

Publisher

published 0.0.104 years ago
M
Q
P

Description

level indexing and finding

Keywords

Publisher

published 0.3.06 years ago
M
Q
P

Description

gets multiple open ports

Keywords

Publisher

published 1.0.35 years ago
M
Q
P

Description

Find an Object in an array of Objects using property and key

Keywords

Publisher

published 0.1.02 years ago
M
Q
P

Description

Infomap optimizes the map equation, which exploits the information-theoretic duality between the problem of compressing data, and the problem of detecting and extracting significant patterns or structures within those data.

Keywords

Publisher

published 1.0.5a year ago
M
Q
P

Description

level indexing and finding

Keywords

Publisher

published 0.3.07 years ago
M
Q
P
M
Q
P

Description

Generates a benchmark network upon input of a mix and average degree for each node in the graph.

Keywords

Publisher

published 1.0.4a year ago
M
Q
P

Description

Layered Label Propagation is a semi-supervised machine learning algorithm that assigns labels to previously unlabeled data points. At the start of the algorithm, a (generally small) subset of the data points have labels (or classifications). These labels

Keywords

Publisher

published 1.0.4a year ago
M
Q
P

Description

This algorithm assesses how similar are 2 input partitions of a given network.

Keywords

Publisher

published 1.0.3a year ago
M
Q
P

Description

Given 2 arrays, hamming distance is calculated between them.

Keywords

Publisher

published 1.0.1a year ago
M
Q
P

Description

Scraper for http://streetpianos-scraper.com/.

Keywords

Publisher

published 1.0.22 years ago