1 /* Copyright (c) 2013-2015. The SimGrid Team.
2 * All rights reserved. */
4 /* This program is free software; you can redistribute it and/or modify it
5 * under the terms of the license (GNU LGPL) which comes with this package. */
9 #include "surf_routing_RoutedGraph.hpp"
11 #ifndef SURF_ROUTING_DIJKSTRA_HPP_
12 #define SURF_ROUTING_DIJKSTRA_HPP_
14 typedef struct graph_node_data {
16 int graph_id; /* used for caching internal graph id's */
17 } s_graph_node_data_t, *graph_node_data_t;
19 typedef struct graph_node_map_element {
21 } s_graph_node_map_element_t, *graph_node_map_element_t;
23 typedef struct route_cache_element {
26 } s_route_cache_element_t, *route_cache_element_t;
35 class XBT_PRIVATE AsDijkstra;
37 /** Dijkstra routing data: fast initialization, slow lookup, small memory requirements, shortest path routing only */
38 class AsDijkstra : public AsRoutedGraph {
40 AsDijkstra(const char*name, bool cached);
44 xbt_node_t routeGraphNewNode(int id, int graph_id);
45 graph_node_map_element_t nodeMapSearch(int id);
46 void newRoute(int src_id, int dst_id, sg_platf_route_cbarg_t e_route);
48 * For each vertex (node) already in the graph,
49 * make sure it also has a loopback link; this loopback
50 * can potentially already be in the graph, and in that
51 * case nothing will be done.
53 * If no loopback is specified for a node, we will use
54 * the loopback that is provided by the routing platform.
56 * After this function returns, any node in the graph
57 * will have a loopback attached to it.
59 void getRouteAndLatency(NetCard *src, NetCard *dst, sg_platf_route_cbarg_t route, double *lat) override;
60 void addRoute(sg_platf_route_cbarg_t route) override;
62 xbt_graph_t routeGraph_ = nullptr; /* xbt_graph */
63 xbt_dict_t graphNodeMap_ = nullptr; /* map */
64 xbt_dict_t routeCache_ = nullptr; /* use in cache mode */
70 #endif /* SURF_ROUTING_DIJKSTRA_HPP_ */