Skip to main content

ClikaRT::graph::WeightedPath

struct

Header: ClikaRT/graph/query.h

A path with the edges it takes and its summed cost: edges[i] joins nodes[i] to nodes[i + 1], naming the parallel edge taken. Empty, at cost 0, when no path runs.

Data members​

nodes​

std::vector<Node> nodes

Declared in ClikaRT/graph/query.h, line 136

edges​

std::vector<Edge> edges

Declared in ClikaRT/graph/query.h, line 137

cost​

double cost = 0.0

Declared in ClikaRT/graph/query.h, line 138