Preprocessing
-
void bidirectional::lowerBoundWeight(std::vector<double> *lower_bound_weight, const DiGraph &graph, const bool &forward)
Solve shortest path using the distance provided as input and set the lower_bound_weight for each node. Uses LEMON’s Bellman-Ford (just in case of negative weights)
- Parameters
lower_bound_weight, vector – [out] of double that contains the lower bound in the appropriate vertex index
graph –
-
int bidirectional::getCriticalRes(const std::vector<double> &max_res, const DiGraph &graph)
[EXPERIMENTAL] Get possible critical resource by solving longest paths on the graph with each resource as distance for each edge.
- Parameters
vector – [in] of double with maximum resources (upper bounds).
bidirectional::DiGraph, with – [in] graph.
- Returns
int with critical resource id.