Tunables for a single routing query. More...

#include <profilerouter.h>

Collaboration diagram for ProfileRouter::Options:

Public Attributes
int	k = 5

int	maxPaths = 10000

bool	undirected = false

int	softCapMs = 200

int	maxIterations = 100000

Detailed Description

Tunables for a single routing query.

Member Data Documentation

◆ k

int ProfileRouter::Options::k = 5

Maximum number of paths to return. Yen's k-shortest.

◆ maxIterations

int ProfileRouter::Options::maxIterations = 100000

Per-query iteration cap on Yen's inner loop. Set to INT_MAX to disable. Mostly useful for deterministic tests of the truncation path.

◆ maxPaths

int ProfileRouter::Options::maxPaths = 10000

Hard cap on number of simple paths enumerateSimplePaths will collect before bailing with Result::truncated = true. Exhaustive enumeration is worst-case exponential on heavily-meshed graphs, so this cap exists to prevent UI freeze on pathological networks. Ignored by kShortestPaths.

◆ softCapMs

int ProfileRouter::Options::softCapMs = 200

Wall-clock soft cap (ms). When exceeded the search returns whatever it has accumulated so far with Result::truncated = true. Set to 0 to disable the cap (not recommended in production).

◆ undirected

bool ProfileRouter::Options::undirected = false

Treat each edge as bidirectional during traversal.

The documentation for this struct was generated from the following file:

/home/runner/work/openswmm.gui/openswmm.gui/include/plot/profilerouter.h