-/* Copyright (c) 2013-2021. The SimGrid Team. All rights reserved. */
+/* Copyright (c) 2013-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. */
-#ifndef SURF_ROUTING_DIJKSTRA_HPP_
-#define SURF_ROUTING_DIJKSTRA_HPP_
+#ifndef SIMGRID_ROUTING_DIJKSTRA_HPP_
+#define SIMGRID_ROUTING_DIJKSTRA_HPP_
#include <simgrid/kernel/routing/RoutedZone.hpp>
-namespace simgrid {
-namespace kernel {
-namespace routing {
+namespace simgrid::kernel::routing {
/** @ingroup ROUTING_API
* @brief NetZone with an explicit routing computed on need with Dijkstra
std::unique_ptr<s_xbt_graph_t, decltype(&DijkstraZone::route_graph_delete)> route_graph_{
xbt_graph_new_graph(1, nullptr), &DijkstraZone::route_graph_delete};
- std::map<int, xbt_node_t> graph_node_map_;
+ std::map<unsigned long, xbt_node_t> graph_node_map_;
bool cached_;
- std::map<int, std::vector<unsigned long>> route_cache_;
+ std::map<unsigned long, std::vector<unsigned long>> route_cache_;
- xbt_node_t route_graph_new_node(int id);
- xbt_node_t node_map_search(int id);
- void new_edge(int src_id, int dst_id, Route* e_route);
+ xbt_node_t route_graph_new_node(unsigned long id);
+ xbt_node_t node_map_search(unsigned long id);
+ void new_edge(unsigned long src_id, unsigned long dst_id, Route* e_route);
void do_seal() override;
public:
void add_route(NetPoint* src, NetPoint* dst, NetPoint* gw_src, NetPoint* gw_dst,
const std::vector<s4u::LinkInRoute>& link_list, bool symmetrical) override;
};
-} // namespace routing
-} // namespace kernel
-} // namespace simgrid
+} // namespace simgrid::kernel::routing
-#endif /* SURF_ROUTING_DIJKSTRA_HPP_ */
+#endif /* SIMGRID_ROUTING_DIJKSTRA_HPP_ */