Graph iterator Dijkstra

Dijkstra's algorithm to find the shortest path between a and b. It picks the unvisited vertex with the lowest distance, calculates the distance through it to each unvisited neighbor, and updates the neighbor's distance if smaller.

Read full: wiki/dijkstra_algorithm

Import

import {GraphIteratorDijkstra} from "@apexds/core";

API reference

API: /api/algorithms/graph/iterator-dijkstra

Example usage

import {Graph} from "@apexds/core";
import {GraphIteratorDijkstra} from "@apexds/core";

const graph = new Graph<string>();
const iterator = new GraphIteratorDijkstra(graph);

iterator.initIterator();

while (iterator.hasNext()) {
    const next = iterator.next();

    if (next === to) {
        break;
    }
}

const path = iterator.getPath(from, to);