profilerouter.cpp File Reference

#include "plot/profilerouter.h"
#include <QElapsedTimer>
#include <QHash>
#include <QSet>
#include <algorithm>
#include <functional>
#include <limits>
#include <queue>
#include <utility>

Include dependency graph for profilerouter.cpp:

Namespaces
namespace	ProfileRouter

Functions
Result	ProfileRouter::enumerateSimplePaths (const Graph &g, int startNode, int endNode, const Options &opts={})
	Enumerates every simple (no-repeated-node) path between startNode and endNode using DFS with backtracking.
Result	ProfileRouter::kShortestPaths (const Graph &g, int startNode, int endNode, const Options &opts={})
	Yen's k-shortest simple paths from startNode to endNode.
Result	ProfileRouter::kShortestPathsThrough (const Graph &g, const QVector< int > &waypoints, const Options &opts={})
	Routes through a sequence of waypoints (start → w1 → … → end).

Detailed Description

Author

Caleb Buahin caleb.nosp@m..bua.nosp@m.hin@g.nosp@m.mail.nosp@m..com

Date

2026

Variable Documentation

edgeIdx

int edgeIdx

edgeIdxs

QVector<int> edgeIdxs

neighbor

int neighbor

nodes

QVector<int> nodes

weight

double weight = 0.0