diff --git a/README.md b/README.md
index bea9b0fbacdcc679c66c3853d45e2c1c22e749af..963e49800d7973459fd241c87b2c35461ebaff70 100644
--- a/README.md
+++ b/README.md
@@ -1,8 +1,18 @@
-# if3230_mp_mst
+# Minimum Spanning Tree with OpenMP and OpenMPI
 
-Cara compile program OpenMP:
-gcc -o MST_OpenMP.out MST_OpenMP.c
+## Deskripsi Program
+Minimum Spanning Tree merupakan suatu tree yang memiliki bobot minimum yang menghubungkan setiap simpul dalam suatu tree. Program kami menggunakan Algoritma Kruskall sebagai dasar dari pembuatan Minimum Spanning Tree ini.
 
+Untuk meningkatkan eksekusi pembangunan tree, maka kami memanfaatkan OpenMP dan OpenMPI sebagai library pemrograman paralel untuk kasus dengan jumlah node > 1000.
+
+## How to Run
 Cara menjalankan program OpenMP:
 ./MST_OpenMP.out < "../test/test_case_01"
-./MST_OpenMP.out
\ No newline at end of file
+./MST_OpenMP.out
+
+## Author
+* Michael Hans / 13518056
+* Kevin Austin Stefano / 13518104
+Cara compile program OpenMP:
+gcc -o MST_OpenMP.out MST_OpenMP.c
+
diff --git a/test/test_case_01.txt b/test/test_case_01.txt
new file mode 100644
index 0000000000000000000000000000000000000000..f5623b7767b59f380fa4dbe28bf094d776bb3876
--- /dev/null
+++ b/test/test_case_01.txt
@@ -0,0 +1,6 @@
+5
+-1  2  6 -1 -1
+ 2 -1  4  1 -1
+ 6  4 -1 -1  1
+-1  1 -1 -1  1
+-1 -1  1  1 -1
\ No newline at end of file
diff --git a/test/test_case_02.txt b/test/test_case_02.txt
new file mode 100644
index 0000000000000000000000000000000000000000..ea027cd5c14d71d4a3fcbe50879cd3c7e4696b7b
--- /dev/null
+++ b/test/test_case_02.txt
@@ -0,0 +1,5 @@
+4
+-1  10   6  5
+10  -1  -1  15
+ 6  -1  -1  4
+ 5  15   4  -1
\ No newline at end of file