From a90aefbf8db45cf26582b96736928d541ef3212c Mon Sep 17 00:00:00 2001
From: Benjamin Loison <12752145+Benjamin-Loison@users.noreply.github.com>
Date: Fri, 27 Oct 2023 14:29:11 +0200
Subject: [PATCH] Improve formatting and fix a typo in `README.md`

---
 README.md | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/README.md b/README.md
index 4aa822a..1ae9a34 100644
--- a/README.md
+++ b/README.md
@@ -10,7 +10,7 @@ A weighted graph G. See graph.txt file as a sample for the input graph format. I
 	u,v,w 
 
 Above line specifies that there is an edge between node u and v with positive weight w. 
-The lowest id should be zero and the nodes id's increase. If you want to used this code for an unweighted graph, 
+The lowest id should be zero and the nodes id's increase. If you want to use this code for an unweighted graph, 
 simply set the weight equal to one on each input line.
 
 ## Output
@@ -21,13 +21,13 @@ This code runs Girvan-Newman algorithm and returns a list of detected communitie
 
 For running the python code, you need to install Python 3 and NetworkX package on your machine. Check link below for more details:
 
-	https://networkx.github.io/documentation/latest/install.html
+https://networkx.github.io/documentation/latest/install.html
 
 ## Girvan-Newman Algorithm Description
 
 You can find the details for how Girvan-Newman algorithm works from the following link: 
 
-	http://www.kazemjahanbakhsh.com/codes/cmty.html
+http://www.kazemjahanbakhsh.com/codes/cmty.html
 
 ## How to run Python script