- bool getBypassRoute(routing::NetPoint* src, routing::NetPoint* dst,
- /* OUT */ std::vector<surf::LinkImpl*>& links, double* latency);
+ bool get_bypass_route(routing::NetPoint* src, routing::NetPoint* dst,
+ /* OUT */ std::vector<resource::LinkImpl*>& links, double* latency);
+
+public:
+ resource::NetworkModel* network_model_;
+
+private:
+ s4u::NetZone piface_;
+
+ // our content, as known to our graph routing algorithm (maps vertex_id -> vertex)
+ std::vector<kernel::routing::NetPoint*> vertices_;
+
+ NetZoneImpl* father_ = nullptr;
+
+ std::vector<NetZoneImpl*> children_; // sub-netzones
+
+public:
+ unsigned int get_table_size() { return vertices_.size(); }
+ std::vector<kernel::routing::NetPoint*> get_vertices() { return vertices_; }
+
+ NetZoneImpl* get_father();
+
+ std::vector<NetZoneImpl*>* get_children(); // Sub netzones
+
+private:
+ std::string name_;
+ bool sealed_ = false; // We cannot add more content when sealed