From 12529619db2a5169fe9517b003dc69ef2c3fa50c Mon Sep 17 00:00:00 2001
From: nicl-nno <nicl.nno@gmail.com>
Date: Tue, 21 Jan 2025 16:12:53 +0300
Subject: [PATCH] fix 3

---
 README_en.rst | 4 ----
 1 file changed, 4 deletions(-)

diff --git a/README_en.rst b/README_en.rst
index 219a7303..c84e7ddc 100644
--- a/README_en.rst
+++ b/README_en.rst
@@ -105,11 +105,7 @@ Following example demonstrates graph search using reference graph & edit distanc
         return found_graph
 
 
-Tracing the lineage of the found_graph reveals how genetic operators (mutations, crossovers, etc.) are applied to a random graph one after another, eventually leading to the target graph:
 
-.. image:: /docs/source/img/evolution_process.gif
-   :alt: Evolution process
-   :align: center
 
 One can also notice that despite the fact that the edit distance generally decreases along the genealogical path, the optimizer sometimes sacrifices local fitness gain of some graphs in order to achieve diversity and thus obtain the best possible solution at the end.