ProfileRouter::Path Struct Reference

A single candidate path: ordered node sequence (length N+1) of engine node indices, the user-supplied link IDs joining them (length N — pulled from Edge::linkId at emit time), and the summed weight along the sequence. More...

#include <profilerouter.h>

Collaboration diagram for ProfileRouter::Path:

Public Member Functions
bool	isEmpty () const

Public Attributes
QVector< int >	nodes
QVector< int >	linkIds
double	weight = 0.0

Detailed Description

A single candidate path: ordered node sequence (length N+1) of engine node indices, the user-supplied link IDs joining them (length N — pulled from Edge::linkId at emit time), and the summed weight along the sequence.

Storing nodes explicitly removes any orientation ambiguity in undirected mode — an undirected edge traversed "backward" appears with nodes[i+1] == edge.fromNode instead of toNode.

Note: linkIds is the public API; internally the algorithm uses edge indices into Graph::edges for filtering. The conversion happens at emit time so consumers don't need the Graph.

Member Function Documentation

isEmpty()

bool ProfileRouter::Path::isEmpty ( ) const

inline

Here is the caller graph for this function:

Member Data Documentation

linkIds

QVector<int> ProfileRouter::Path::linkIds

nodes

QVector<int> ProfileRouter::Path::nodes

weight

double ProfileRouter::Path::weight = 0.0

---

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

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