DijkstraQueue

A priority queue item for sorting vertices by the cost to get to them.

package

struct DijkstraQueue (

GraphT

DistanceMapT

) {

alias Vertex = GraphT.VertexDescriptor;

this(const(DistanceMapT) distances);

void push(Vertex v);

Vertex front();

void updateVertex(Vertex v);

bool empty [@property getter];

size_t length [@property getter];

PriorityQueue!Item _queue;

const(DistanceMapT*) _distanceMap;

}

Constructors

this this(const(DistanceMapT) distances): Undocumented in source.

Members

Aliases

Vertex alias Vertex = GraphT.VertexDescriptor: Undocumented in source.

Functions

front Vertex front(): Undocumented in source. Be warned that the author may not have intended to support it.
pop void pop(): Undocumented in source. Be warned that the author may not have intended to support it.
push void push(Vertex v): Undocumented in source. Be warned that the author may not have intended to support it.
updateVertex void updateVertex(Vertex v): Undocumented in source. Be warned that the author may not have intended to support it.

Properties

empty bool empty [@property getter]: Undocumented in source. Be warned that the author may not have intended to support it.
length size_t length [@property getter]: Undocumented in source. Be warned that the author may not have intended to support it.

Structs

Item struct Item: Undocumented in source.

Variables

_distanceMap const(DistanceMapT*) _distanceMap;: Undocumented in source.
_queue PriorityQueue!Item _queue;: Undocumented in source.

Meta

Source

See Implementation

anansi algorithms dijkstra structs

templates