Spell check.

[simgrid.git] / include / simgrid / kernel / routing / DijkstraZone.hpp

diff --git a/include/simgrid/kernel/routing/DijkstraZone.hpp b/include/simgrid/kernel/routing/DijkstraZone.hpp
index c180b75..c7a2cc8 100644 (file)
--- a/include/simgrid/kernel/routing/DijkstraZone.hpp
+++ b/include/simgrid/kernel/routing/DijkstraZone.hpp
@@ -14,7 +14,7 @@ namespace kernel {
 namespace routing {
 
 /** @ingroup ROUTING_API
- *  @brief NetZone with an explicit routing computed on need with Dijsktra
+ *  @brief NetZone with an explicit routing computed on need with Dijkstra
  *
  *  The path between components is computed each time you request it,
  *  using the Dijkstra algorithm. A cache can be used to reduce the computation.
@@ -24,8 +24,9 @@ namespace routing {
  */
 class XBT_PRIVATE DijkstraZone : public RoutedZone {
 public:
-  DijkstraZone(NetZoneImpl* father, std::string name, resource::NetworkModel* netmodel, bool cached);
-  void seal() override;
+  DijkstraZone(NetZoneImpl* father, const std::string& name, resource::NetworkModel* netmodel, bool cached);
+  DijkstraZone(const DijkstraZone&) = delete;
+  DijkstraZone& operator=(const DijkstraZone&) = delete;
 
   ~DijkstraZone() override;
 
@@ -46,6 +47,7 @@ public:
    * After this function returns, any node in the graph
    * will have a loopback attached to it.
    */
+  void seal() override;
   void get_local_route(NetPoint* src, NetPoint* dst, RouteCreationArgs* route, double* lat) override;
   void add_route(NetPoint* src, NetPoint* dst, NetPoint* gw_src, NetPoint* gw_dst,
                  std::vector<resource::LinkImpl*>& link_list, bool symmetrical) override;