Comparing version
@@ -8,4 +8,5 @@ declare class Dijkstra { | ||
create(times: number[][], numNodes: number): void; | ||
adjacentList(): number[][][]; | ||
shortestPath(k: number): number; | ||
} | ||
export { Dijkstra }; |
@@ -26,2 +26,5 @@ "use strict"; | ||
}; | ||
Dijkstra.prototype.adjacentList = function () { | ||
return this._adjList; | ||
}; | ||
Dijkstra.prototype.shortestPath = function (k) { | ||
@@ -28,0 +31,0 @@ var queue = new priorityQueue_1.PriorityQueue(this._comparator); |
{ | ||
"name": "flex-algo", | ||
"version": "0.1.22", | ||
"version": "0.1.23", | ||
"description": "\"SDK for commonly used data structure and algorithms\"", | ||
@@ -5,0 +5,0 @@ "main": "lib/index.js", |
31992
0.39%861
0.47%