-/* Copyright (c) 2009-2022. The SimGrid Team. All rights reserved. */
+/* Copyright (c) 2009-2023. The SimGrid Team. All rights reserved. */
/* This program is free software; you can redistribute it and/or modify it
* under the terms of the license (GNU LGPL) which comes with this package. */
#include <queue>
#include <vector>
-XBT_LOG_NEW_DEFAULT_SUBCATEGORY(ker_routing_dijkstra, ker_routing, "Kernel Dijkstra Routing");
+XBT_LOG_NEW_DEFAULT_SUBCATEGORY(ker_routing_dijkstra, ker_platform, "Kernel Dijkstra Routing");
namespace simgrid {
-namespace kernel {
-namespace routing {
+namespace kernel::routing {
class GraphNodeData {
public:
insert_link_latency(route->link_list_, e_route->link_list_, lat);
}
- auto elm = route_cache_.try_emplace(src_id);
- std::vector<unsigned long>& pred_arr = elm.first->second;
+ auto [elm, inserted] = route_cache_.try_emplace(src_id);
+ std::vector<unsigned long>& pred_arr = elm->second;
- if (elm.second) { /* new element was inserted (not cached mode, or cache miss) */
+ if (inserted) { /* new element was inserted (not cached mode, or cache miss) */
unsigned long nr_nodes = xbt_dynar_length(nodes);
std::vector<unsigned long> cost_arr(nr_nodes); /* link cost from src to other hosts */
pred_arr.resize(nr_nodes); /* predecessors in path from src */
// Finally add it
xbt_graph_new_edge(route_graph_.get(), src, dst, route);
}
-} // namespace routing
-} // namespace kernel
+} // namespace kernel::routing
namespace s4u {
NetZone* create_dijkstra_zone(const std::string& name, bool cache)