From 07aa6a3746ab535261c790fdb774ab7add1126e8 Mon Sep 17 00:00:00 2001 From: Jannetta Steyn Date: Wed, 14 Aug 2024 08:54:15 +0100 Subject: [PATCH] Fix typo --- doc/Tutorials/working-with-algorithms-and-generators.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/doc/Tutorials/working-with-algorithms-and-generators.md b/doc/Tutorials/working-with-algorithms-and-generators.md index ef15a2d..46e3f33 100644 --- a/doc/Tutorials/working-with-algorithms-and-generators.md +++ b/doc/Tutorials/working-with-algorithms-and-generators.md @@ -18,7 +18,7 @@ an algorithm. It contains two methods : * ``init( Graph g )``, which is the initialization step of the algorithm ; * ``compute()``, which launches the algorithm. -### Why does we not just use a ``compute(Graph)`` method ? +### Why do we not just use a ``compute(Graph)`` method ? The initialization step and computing step are located in different methods because you may have to make a new computation of your algorithm without