Update readme.md

Author: javadev

src/main/java/g0101_0200/s0133_clone_graph/readme.md

@@ -26,7 +26,13 @@ The given node will always be the first node with `val = 1`. You must return the
 
 **Output:** [[2,4],[1,3],[2,4],[1,3]]
 
-**Explanation:** There are 4 nodes in the graph. 1st node (val = 1)'s neighbors are 2nd node (val = 2) and 4th node (val = 4). 2nd node (val = 2)'s neighbors are 1st node (val = 1) and 3rd node (val = 3). 3rd node (val = 3)'s neighbors are 2nd node (val = 2) and 4th node (val = 4). 4th node (val = 4)'s neighbors are 1st node (val = 1) and 3rd node (val = 3). 
+**Explanation:**
+
+    There are 4 nodes in the graph.
+    1st node (val = 1)'s neighbors are 2nd node (val = 2) and 4th node (val = 4).
+    2nd node (val = 2)'s neighbors are 1st node (val = 1) and 3rd node (val = 3).
+    3rd node (val = 3)'s neighbors are 2nd node (val = 2) and 4th node (val = 4).
+    4th node (val = 4)'s neighbors are 1st node (val = 1) and 3rd node (val = 3). 
 
 **Example 2:**
 
@@ -52,4 +58,4 @@ The given node will always be the first node with `val = 1`. You must return the
 *   `1 <= Node.val <= 100`
 *   `Node.val` is unique for each node.
 *   There are no repeated edges and no self-loops in the graph.
-*   The Graph is connected and all nodes can be visited starting from the given node.
+*   The Graph is connected and all nodes can be visited starting from the given node.