dijkstra-tree

Implementation of Dijkstra's algorithm that returns a shortest path tree instead of a path between two nodes.

Install

npm install --save dijkstra-tree

Usage

import {DijkstraTree} from "../src";

const graph = [
  { origin: "A", destination: "B", distance: 10 },
  { origin: "B", destination: "C", distance: 10 },
  { origin: "B", destination: "C", distance: 5 },
  { origin: "C", destination: "D", distance: 11 },
];

const algorithm = new DijkstraTree(graph);
const result = algorithm.getTree("A");

console.log(result);
// {
//   "A": {distance: 0, path: ['A']},
//   "B": {distance: 10, path: ['A', 'B']},
//   "C": {distance: 15, path: ['A', 'B', 'C'],
//   "D": {distance: 26, path: ['A', 'B', 'C', 'D']}
// };

Testing

npm test

Contributing

Issues, PRs and contributions are welcome. Please ensure any changes have an accompanying test.