Interface SearchVisit

Represents a visit during a node search. See Node.Search.

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

Hierarchy (view full)

SearchVisit
- DijkstraSearchVisit

Index

Properties

index node path

Properties

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.