diff --git a/README.md b/README.md
index 963e49800d7973459fd241c87b2c35461ebaff70..1b7302618541cf7dcc89f28a4827552d724cc018 100644
--- a/README.md
+++ b/README.md
@@ -6,13 +6,19 @@ Minimum Spanning Tree merupakan suatu tree yang memiliki bobot minimum yang meng
 Untuk meningkatkan eksekusi pembangunan tree, maka kami memanfaatkan OpenMP dan OpenMPI sebagai library pemrograman paralel untuk kasus dengan jumlah node > 1000.
 
 ## How to Run
+Pertama pastikan adnda berada pada bagian home (bukan pada folder src dan folder test) <br><br>
+```
+Cara compile program OpenMP:
+gcc -o MST_OpenMP MST_OpenMP.c
+```
+<br>
+```
 Cara menjalankan program OpenMP:
-./MST_OpenMP.out < "../test/test_case_01"
-./MST_OpenMP.out
+./src/MST_OpenMP < "./test/test_1"
+```
 
 ## Author
 * Michael Hans / 13518056
 * Kevin Austin Stefano / 13518104
-Cara compile program OpenMP:
-gcc -o MST_OpenMP.out MST_OpenMP.c
+
 
diff --git a/src/MST_OpenMP.out b/src/MST_OpenMP.out
new file mode 100755
index 0000000000000000000000000000000000000000..81f11debdaf328022fa25db0eb3d50a202cea1f0
Binary files /dev/null and b/src/MST_OpenMP.out differ
diff --git a/test/test_case_01.txt b/test/test_1
similarity index 100%
rename from test/test_case_01.txt
rename to test/test_1
diff --git a/test/test_case_02.txt b/test/test_2
similarity index 100%
rename from test/test_case_02.txt
rename to test/test_2