1 /* Copyright (c) 2013-2016. 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/AsRoutedGraph.hpp"
11 typedef struct graph_node_data {
13 int graph_id; /* used for caching internal graph id's */
14 } s_graph_node_data_t, *graph_node_data_t;
16 typedef struct graph_node_map_element {
18 } s_graph_node_map_element_t, *graph_node_map_element_t;
20 typedef struct route_cache_element {
23 } s_route_cache_element_t, *route_cache_element_t;
33 /** Dijkstra routing data: fast initialization, slow lookup, small memory requirements, shortest path routing only */
34 class XBT_PRIVATE AsDijkstra : public AsRoutedGraph {
36 AsDijkstra(As* father, const char* name, bool cached);
39 ~AsDijkstra() override;
40 xbt_node_t routeGraphNewNode(int id, int graph_id);
41 graph_node_map_element_t nodeMapSearch(int id);
42 void newRoute(int src_id, int dst_id, sg_platf_route_cbarg_t e_route);
44 * For each vertex (node) already in the graph,
45 * make sure it also has a loopback link; this loopback
46 * can potentially already be in the graph, and in that
47 * case nothing will be done.
49 * If no loopback is specified for a node, we will use
50 * the loopback that is provided by the routing platform.
52 * After this function returns, any node in the graph
53 * will have a loopback attached to it.
55 void getRouteAndLatency(NetCard *src, NetCard *dst, sg_platf_route_cbarg_t route, double *lat) override;
56 void addRoute(sg_platf_route_cbarg_t route) override;
58 xbt_graph_t routeGraph_ = nullptr; /* xbt_graph */
59 xbt_dict_t graphNodeMap_ = nullptr; /* map */
60 xbt_dict_t routeCache_ = nullptr; /* use in cache mode */
65 #endif /* SURF_ROUTING_DIJKSTRA_HPP_ */