1 /* Copyright (c) 2013-2017. The SimGrid Team. All rights reserved. */
3 /* This program is free software; you can redistribute it and/or modify it
4 * under the terms of the license (GNU LGPL) which comes with this package. */
6 #ifndef SURF_ROUTING_DIJKSTRA_HPP_
7 #define SURF_ROUTING_DIJKSTRA_HPP_
9 #include "src/kernel/routing/RoutedZone.hpp"
11 struct s_graph_node_data_t {
13 int graph_id; /* used for caching internal graph id's */
15 typedef s_graph_node_data_t* graph_node_data_t;
25 /** @ingroup ROUTING_API
26 * @brief NetZone with an explicit routing computed on need with Dijsktra
28 * The path between components is computed each time you request it,
29 * using the Dijkstra algorithm. A cache can be used to reduce the computation.
31 * This result in rather small platform file, very fast initialization, and very low memory requirements, but somehow long path resolution times.
33 class XBT_PRIVATE DijkstraZone : public RoutedZone {
35 DijkstraZone(NetZone* father, std::string name, bool cached);
38 ~DijkstraZone() override;
39 xbt_node_t routeGraphNewNode(int id, int graph_id);
40 xbt_node_t nodeMapSearch(int id);
41 void newRoute(int src_id, int dst_id, sg_platf_route_cbarg_t e_route);
42 /* For each vertex (node) already in the graph,
43 * make sure it also has a loopback link; this loopback
44 * can potentially already be in the graph, and in that
45 * case nothing will be done.
47 * If no loopback is specified for a node, we will use
48 * the loopback that is provided by the routing platform.
50 * After this function returns, any node in the graph
51 * will have a loopback attached to it.
53 void getLocalRoute(NetPoint* src, NetPoint* dst, sg_platf_route_cbarg_t route, double* lat) override;
54 void addRoute(sg_platf_route_cbarg_t route) override;
56 xbt_graph_t routeGraph_ = nullptr; /* xbt_graph */
57 std::map<int, xbt_node_t> graphNodeMap_; /* map */
58 bool cached_; /* cache mode */
59 std::map<int, std::vector<int>> routeCache_; /* use in cache mode */
65 #endif /* SURF_ROUTING_DIJKSTRA_HPP_ */