X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/8bd1d4d43b1cbdeec15247821932f6ca0971fd96..df3bdefc3df0a0810cf48411dd588ed63c65a302:/src/xbt/graph.c

diff --git a/src/xbt/graph.c b/src/xbt/graph.c
index 0c8325a789..56cf62e194 100644
--- a/src/xbt/graph.c
+++ b/src/xbt/graph.c
@@ -203,7 +203,7 @@ double xbt_graph_edge_get_length(xbt_edge_t edge)
  *
  * From wikipedia:
  *
- * The Floyd–Warshall algorithm takes as input an adjacency matrix representation of a weighted, directed graph (V, E).
+ * The Floyd-Warshall algorithm takes as input an adjacency matrix representation of a weighted, directed graph (V, E).
  * The weight of a path between two vertices is the sum of the weights of the edges along that path. The edges E of the
  * graph may have negative weights, but the graph must not have any negative weight cycles. The algorithm computes, for
  * each pair of vertices, the minimum weight among all paths between the two vertices. The running time complexity is