diff --git a/MEV_strategies/arbitrage/algorithms/README.md b/MEV_strategies/arbitrage/algorithms/README.md
index e0f598b..bf959a4 100644
--- a/MEV_strategies/arbitrage/algorithms/README.md
+++ b/MEV_strategies/arbitrage/algorithms/README.md
@@ -7,7 +7,7 @@
 <br>
 
 
-* multi-edged graph where nodes represent coins and edges represents rates.
+* these algorithms are represented by multi-edged graph data structures where nodes represent coins and edges represents rates.
 * to find an arb opportunity, find a closed loop of edges for which the product of weights in the edges > 1.
 
 <br>