A simple JavaScript (Node.js) implementation of Dijkstra's single-source shortest-paths algorithm. Useful for computing shortest paths from one starting node in graph-style problems, with example usage referenced in the included tests.
Project status
- The source (tcort/dijkstrajs) appears not actively maintained. The most recent upstream push and the newest recorded updates are from 2023-04-15, over three years ago relative to 2026-09-10.
- Update cadence looks intermittent and long-gap: updates were tagged in 2023, with the prior one in 2021, and earlier tags in 2015 and 2014.
AI summary generated
Recent updates
v1.0.3
Release v1.0.3 contains no documented functional changes in the provided release notes (none were supplied). The diff shows only metadata and dependency tooling changes: package version bump, devDependency upgrades, and a large npm lockfile restructure.
Breakingv1.0.2
Release v1.0.2 updates the published package version and introduces a package-lock.json. The only other changes shown in the diff are README badge removals and development dependency upgrades (jshint and mocha), with no direct changes to the core Dijkstra implementation visible in the provided diff.
v1.0.1
Release v1.0.1 was published on 2015-11-13. No release notes or change details were provided by the publisher, so developer impact cannot be determined from the release text alone.
v1.0.0
This release is tagged v1.0.0, but the publisher did not provide any release notes. As a result, there is no documented information about new features, fixes, breaking changes, or dependency updates in the available data.