GitHub / chen0040 / js-graph-algorithms
Package provides javascript implementation of algorithms for graph processing
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chen0040%2Fjs-graph-algorithms
PURL: pkg:github/chen0040/js-graph-algorithms
Stars: 151
Forks: 41
Open issues: 9
License: mit
Language: JavaScript
Size: 1.49 MB
Dependencies parsed at: Pending
Created at: about 8 years ago
Updated at: about 2 months ago
Pushed at: almost 2 years ago
Last synced at: about 1 month ago
Commit Stats
Commits: 49
Authors: 2
Mean commits per author: 24.5
Development Distribution Score: 0.082
More commit stats: https://commits.ecosyste.ms/hosts/GitHub/repositories/chen0040/js-graph-algorithms
Topics: bellman-ford-algorithm, breadth-first-search, connected-components, depth-first-search, dijkstra, dijkstra-shortest-path, kruskal-algorithm, maxflow, mincut, minimum-spanning-trees, prim-algorithm, strongly-connected-components, topological-sort