Socket
Socket
Sign inDemoInstall

graphlib

Package Overview
Dependencies
Maintainers
1
Versions
59
Alerts
File Explorer

Advanced tools

Socket logo

Install Socket

Detect and block malicious and high-risk dependencies

Install

graphlib - npm Package Compare versions

Comparing version 0.1.0 to 0.1.1

lib/alg/dijkstra.js

11

CHANGELOG.md

@@ -0,1 +1,8 @@

v0.1.1
======
* Added Dijkstra's Algorithm (`alg.dijkstra`) for finding all single source
shortest paths.
* Added `alg.dijkstraAll` for finding all shortest paths.
v0.1.0

@@ -21,4 +28,4 @@ ======

* Added a new method, `Digraph.incidentEdges`, that returns all edges incident
on a node `u` with `Digraph.incidentEdges(u)` or all edges between two nodes
- regardless of direction - with `Digraph.incidentEdges(u, v)`.
on a node `u` with `Digraph.incidentEdges(u)` or all edges between two nodes -
regardless of direction - with `Digraph.incidentEdges(u, v)`.

@@ -25,0 +32,0 @@ v0.0.6

exports.Digraph = require("./lib/Digraph");
exports.alg = {
isAcyclic: require("./lib/alg/isAcyclic"),
dijkstra: require("./lib/alg/dijkstra"),
dijkstraAll: require("./lib/alg/dijkstraAll"),
findCycles: require("./lib/alg/findCycles"),

@@ -5,0 +7,0 @@ tarjan: require("./lib/alg/tarjan"),

2

lib/version.js

@@ -1,1 +0,1 @@

module.exports = '0.1.0';
module.exports = '0.1.1';
{
"name": "graphlib",
"version": "0.1.0",
"version": "0.1.1",
"description": "A multi-graph library",

@@ -5,0 +5,0 @@ "main": "index.js",

SocketSocket SOC 2 Logo

Product

  • Package Alerts
  • Integrations
  • Docs
  • Pricing
  • FAQ
  • Roadmap
  • Changelog

Packages

npm

Stay in touch

Get open source security insights delivered straight into your inbox.


  • Terms
  • Privacy
  • Security

Made with ⚡️ by Socket Inc