std::vector<double> cost_arr(nr_nodes); /* link cost from src to other hosts */
pred_arr.resize(nr_nodes); /* predecessors in path from src */
typedef std::pair<double, int> Qelt;
- std::priority_queue<Qelt, std::vector<Qelt>, std::greater<Qelt>> pqueue;
+ std::priority_queue<Qelt, std::vector<Qelt>, std::greater<>> pqueue;
/* initialize */
cost_arr[src_node_id] = 0.0;
{
add_route_check_params(src, dst, gw_src, gw_dst, link_list, symmetrical);
- new_edge(src->id(), dst->id(),
- new_extended_route(hierarchy_, src, dst, gw_src, gw_dst, link_list, symmetrical, true));
+ new_edge(src->id(), dst->id(), new_extended_route(hierarchy_, gw_src, gw_dst, link_list, true));
- if (symmetrical == true)
- new_edge(dst->id(), src->id(),
- new_extended_route(hierarchy_, dst, src, gw_dst, gw_src, link_list, symmetrical, false));
+ if (symmetrical)
+ new_edge(dst->id(), src->id(), new_extended_route(hierarchy_, gw_dst, gw_src, link_list, false));
}
void DijkstraZone::new_edge(int src_id, int dst_id, RouteCreationArgs* route)