Interface DijkstraSearchVisit

Represents a visit to a node during Dijkstra's algorithm.

interface DijkstraSearchVisit {
    distance: number;
    index: number;
    node: BaseNode.Class<BaseNode.Data, BaseNode.ScratchData>;
    path: BaseEdge.Class<BaseEdge.Data, BaseEdge.ScratchData>[];
}

Hierarchy (view full)

SearchVisit
- DijkstraSearchVisit

Index

Properties

distance index node path

Properties

distance

distance: number

The minimum weight from the root node to the current node.

index

index: number

The current iteration number.

node

node: BaseNode.Class<BaseNode.Data, BaseNode.ScratchData>

The current node that is being visited.

path

path: BaseEdge.Class<BaseEdge.Data, BaseEdge.ScratchData>[]

The path taken in this visit from the root node to the current node.