Portable and language managers
npm install -g js-graph-algorithmslocal npm package metadata
npm / rank 1102
Package implements data structures and algorithms for processing various types of graphs. Version 1.0.18 via npm; verified 2017-11-28.
install
npm install -g js-graph-algorithmslocal npm package metadata
overview
Package implements data structures and algorithms for processing various types of graphs
security posture
No matching local secret-handling manifest was found for js-graph-algorithms. Nucleus package metadata is still published here so future coverage has a stable package URL.
Before unattended agent use, check whether the tool reads plaintext credentials, writes remote state, publishes artifacts, or shells out to plugins.
executables
| Command | Kind | Exposure | Note |
|---|---|---|---|
js-graphs | cli | global executable |
freshness
These signals separate page generation age, package-manager activity, and upstream release comparison. Version lag is warned only when an evidence URL and comparable versions are present.
https://github.com/chen0040/js-graph-algorithms
install metadata
| Package key | npm:js-graph-algorithms |
|---|---|
| Version | 1.0.18 |
| Package manager | npm |
| Package manager page | https://www.npmjs.com/package/js-graph-algorithms |
| Homepage | https://github.com/chen0040/js-graph-algorithms#readme |
| Repository | https://github.com/chen0040/js-graph-algorithms |
| Upstream docs | https://github.com/chen0040/js-graph-algorithms#readme |
| License | MIT |
| Source archive | https://registry.npmjs.org/js-graph-algorithms/-/js-graph-algorithms-1.0.18.tgz |
| Issue tracker | https://github.com/chen0040/js-graph-algorithms/issues |
| Last updated | 2017-11-28T22:59:14.048Z |
| Published | 2017-11-28T22:59:14.048Z |
| Build dependencies | chai, coveralls, grunt, grunt-contrib-uglify, grunt-eslint, grunt-mocha-test, istanbul, mocha |
| Bottle | not recorded |
| npm postinstall | not defined |
| Service | none declared |
| Keywords | graph, weighted graph, digraph, directed graph, connected components, strongly connected components, min cut, max flow, dijkstra, bellman-ford, minimum spanning tree, depth first search, breadth first search, directed cycles, topological sort, ford-fulkerson |
registry facts
| Source Database | npm registry |
|---|---|
| Dist Tags | |
| Version Count | 13 |
| Maintainers |
|
| Author | Xianshun Chen |
| Publisher | chen0040 |
| Integrity | sha512-Gu1wtWzXBzGeye/j9BuyplGHscwqKRZodp/0M1vyBc19RJpblSwKGu099KwwaTx9cRIV+Qupk8xUMfEiGfFqSA== |
| Shasum | f96ec87bf194f5c0a31365fa0e1d07b7b962d891 |
| File Count | 0 |
| Created At | 2017-05-27T12:37:37.308Z |
| Latest Published At | 2017-11-28T22:59:14.048Z |
| Modified At | 2022-06-19T05:35:36.239Z |
source trail
This page is generated by av-web from the private package SQLite artifact built by scripts/generate-pkg-sqlite.py.