#include <xbt/base.h>
-#include "surf_routing_generic.hpp"
+#include "surf_routing_RoutedGraph.hpp"
#ifndef SURF_ROUTING_DIJKSTRA_HPP_
#define SURF_ROUTING_DIJKSTRA_HPP_
class XBT_PRIVATE AsDijkstra;
-class AsDijkstra : public AsGeneric {
+/** Dijkstra routing data: fast initialization, slow lookup, small memory requirements, shortest path routing only */
+class AsDijkstra : public AsRoutedGraph {
public:
- AsDijkstra();
- AsDijkstra(bool cached);
+ AsDijkstra(const char*name, bool cached);
+ void Seal() override;
+
~AsDijkstra();
xbt_node_t routeGraphNewNode(int id, int graph_id);
graph_node_map_element_t nodeMapSearch(int id);
* After this function returns, any node in the graph
* will have a loopback attached to it.
*/
- void addLoopback();
void getRouteAndLatency(NetCard *src, NetCard *dst, sg_platf_route_cbarg_t route, double *lat) override;
- xbt_dynar_t getOneLinkRoutes() override;
void getRouteAndLatency(sg_platf_route_cbarg_t route, double *lat); // FIXME: this function is dangerously not overriding because of diverging prototype
- void parseASroute(sg_platf_route_cbarg_t route) override;
- void parseRoute(sg_platf_route_cbarg_t route) override;
- void end();
+ xbt_dynar_t getOneLinkRoutes() override;
+ void addRoute(sg_platf_route_cbarg_t route) override;
- xbt_graph_t p_routeGraph = nullptr; /* xbt_graph */
- xbt_dict_t p_graphNodeMap = nullptr; /* map */
- xbt_dict_t p_routeCache = nullptr; /* use in cache mode */
- bool m_cached = false;
+ xbt_graph_t routeGraph_ = nullptr; /* xbt_graph */
+ xbt_dict_t graphNodeMap_ = nullptr; /* map */
+ xbt_dict_t routeCache_ = nullptr; /* use in cache mode */
};
}