SingleSourceShortestPathsSolution

struct SingleSourceShortestPathsSolution (

weight_t

) if (

isNumeric!weight_t

) {

static if(isFloatingPoint!weight_t)

enum unconnectedWeight;

static if(!(isFloatingPoint!weight_t))

enum unconnectedWeight;

enum noPredecessor;

size_t startNode;

size_t[] topologicalOrder;

size_t numNodes [@property getter];

const(weight_t)[] distances [@property getter];

size_t distance [@property setter];

size_t distance [@property setter];

size_t isConnected [@property setter];

size_t predecessor [@property setter];

size_t predecessor [@property setter];

size_t hasPredecessor [@property setter];

struct ReverseShortestPath;

ReverseShortestPath reverseShortestPath(size_t dest);

}

Members

Functions

reverseShortestPath ReverseShortestPath reverseShortestPath(size_t dest): Traverse shortest path from dest to startNode; empty if !isConnected(dest).

Manifest constants

noPredecessor enum noPredecessor;: Undocumented in source.
unconnectedWeight enum unconnectedWeight;: Undocumented in source.
unconnectedWeight enum unconnectedWeight;: Undocumented in source.

Properties

distance size_t distance [@property setter]
distance size_t distance [@property setter]
distances const(weight_t)[] distances [@property getter]
hasPredecessor size_t hasPredecessor [@property setter]
isConnected size_t isConnected [@property setter]
numNodes size_t numNodes [@property getter]
predecessor size_t predecessor [@property setter]
predecessor size_t predecessor [@property setter]

Structs

ReverseShortestPath struct ReverseShortestPath

Variables

startNode size_t startNode;
topologicalOrder size_t[] topologicalOrder;

Meta

Source

See Implementation

dalicious algorithm graph classes

NoDAG

functions

structs