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/surf/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;
32 /** Dijkstra routing data: fast initialization, slow lookup, small memory requirements, shortest path routing only */
33 class XBT_PRIVATE AsDijkstra : public AsRoutedGraph {
35 AsDijkstra(const char*name, bool cached);
39 xbt_node_t routeGraphNewNode(int id, int graph_id);
40 graph_node_map_element_t nodeMapSearch(int id);
41 void newRoute(int src_id, int dst_id, sg_platf_route_cbarg_t e_route);
43 * For each vertex (node) already in the graph,
44 * make sure it also has a loopback link; this loopback
45 * can potentially already be in the graph, and in that
46 * case nothing will be done.
48 * If no loopback is specified for a node, we will use
49 * the loopback that is provided by the routing platform.
51 * After this function returns, any node in the graph
52 * will have a loopback attached to it.
54 void getRouteAndLatency(NetCard *src, NetCard *dst, sg_platf_route_cbarg_t route, double *lat) override;
55 void addRoute(sg_platf_route_cbarg_t route) override;
57 xbt_graph_t routeGraph_ = nullptr; /* xbt_graph */
58 xbt_dict_t graphNodeMap_ = nullptr; /* map */
59 xbt_dict_t routeCache_ = nullptr; /* use in cache mode */
65 #endif /* SURF_ROUTING_DIJKSTRA_HPP_ */