From: Martin Quinson <martin.quinson@loria.fr>
Date: Wed, 28 Dec 2016 14:31:47 +0000 (+0100)
Subject: cosmetics in doc
X-Git-Tag: v3_14_159~2
X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/commitdiff_plain/77d2cf3ada13c9868c6e9549dd636392769282ac

cosmetics in doc
---

diff --git a/src/kernel/routing/DijkstraZone.hpp b/src/kernel/routing/DijkstraZone.hpp
index a8432cb4c9..83786e34c2 100644
--- a/src/kernel/routing/DijkstraZone.hpp
+++ b/src/kernel/routing/DijkstraZone.hpp
@@ -37,10 +37,8 @@ namespace routing {
  *  using the Dijkstra algorithm. A cache can be used to reduce the computation.
  *
  *  This result in rather small platform file, very fast initialization, and intermediate memory requirements
- *  (somewhere between the one of @{DijkstraZone} and the one of @{FullZone}).
+ *  (somewhere between the one of @DijkstraZone and the one of @FullZone).
  */
-
-/** Dijkstra routing data: fast initialization, slow lookup, small memory requirements, shortest path routing only */
 class XBT_PRIVATE DijkstraZone : public RoutedZone {
 public:
   DijkstraZone(NetZone* father, const char* name, bool cached);
@@ -50,8 +48,7 @@ public:
   xbt_node_t routeGraphNewNode(int id, int graph_id);
   graph_node_map_element_t nodeMapSearch(int id);
   void newRoute(int src_id, int dst_id, sg_platf_route_cbarg_t e_route);
-  /**
-   * For each vertex (node) already in the graph,
+  /* For each vertex (node) already in the graph,
    * make sure it also has a loopback link; this loopback
    * can potentially already be in the graph, and in that
    * case nothing will be done.