Skip to main content

ClikaRT::graph::PathOptions

struct

Header: ClikaRT/graph/query.h

The bounds and filters of a path query (ModelGraph::find_paths_to, has_path, shortest_path, all_simple_paths, all_simple_edge_paths, count_paths). A path never repeats a node.

Data members​

cutoff​

std::optional<std::size_t> cutoff

The most edges a path may have: 0 admits only the one-node path. Empty: no limit.

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

limit​

std::optional<std::size_t> limit

The most paths a listing returns: the first ones, depth-first, and a listing with a limit never fails for its length. Empty: up to kMaxPathsWithoutLimit. has_path, shortest_path and count_paths do not read it.

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

avoid​

std::vector<Node> avoid

Nodes no path may hold, its two ends included.

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

edge_filter​

EdgePredicate edge_filter

The edges a path may take. Empty: every edge.

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