graph-dijkstra

MITLicense declared in the package manifest.

A simple undirected graph that allows for finding the shortest path between nodes via Dijkstra's algorithm

graphshortestpathdijkstraundirectednodessimple
85

Security score

0 known advisories in v1.2.0

0-100 score computed by this site from verifiable signals only: known OSV.dev advisories affecting this exact version, how recently it was published, and the repository's OpenSSF Scorecard.advisory penalty −0 · staleness penalty −15

Weekly downloads

Downloads across all versions in the last 7 days, from the official npm downloads API (api.npmjs.org).

—

Unpacked size

Size of v1.2.0 on disk after npm install extracts the tarball, as reported by the npm registry.

—

Dependencies

Direct runtime dependencies declared by v1.2.0. Transitive dependencies are not counted here — use the lockfile audit for the full tree.

0

Last publish

When v1.2.0 was published to the registry. Long gaps can indicate an unmaintained package.

10 years ago

Security advisories

Vulnerabilities affecting v1.2.0 specifically, from OSV.dev — the open database aggregating the GitHub Advisory Database (GHSA) and CVEs. Links open the full advisory.

No known vulnerabilities affect v1.2.0.