From 80fbedbe49002dcd1cda3b540e05ee75051b8021 Mon Sep 17 00:00:00 2001
From: Shalin Shah <shah.shalin@gmail.com>
Date: Sat, 20 Jul 2019 09:50:44 -0700
Subject: [PATCH] Update README.md

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 05789bb..80f5208 100644
--- a/README.md
+++ b/README.md
@@ -13,7 +13,7 @@ This algorithm performs the following steps:
 	4) If the complete clique formed in step 3 is better than gBest, gBest = (3).
 	5) Continue from step 2 till some termination criteria (Number of Iterations)
 
-Instances are available <a href="http://www.nlsde.buaa.edu.cn/~kexu/benchmarks/graph-benchmarks.htm">here</a> and <a href="http://iridia.ulb.ac.be/~fmascia/maximum_clique/DIMACS-benchmark">here (DIMACS)</a>.
+Instances are available <a href="http://www.nlsde.buaa.edu.cn/~kexu/benchmarks/graph-benchmarks.htm">here</a> and <a href="http://iridia.ulb.ac.be/~fmascia/maximum_clique/DIMACS-benchmark">here (DIMACS)</a>. Please remove all comments and other extraneous text from the graph text instance file.
 
 Usage:
 	- Change Constants.FILE to the file on your disk that represents the graph