Update README.md

README.md

@@ -295,9 +295,9 @@ There are three mathematics tasks. Each task is structured as a classification p
 ```python
 from datasets import load_dataset
 
-dataset_connectivity = load_dataset('isobench/IsoBench', 'math_parity', split='validation')
-dataset_maxflow = load_dataset('isobench/IsoBench', 'math_convexity', split='validation')
-dataset_isomorphism = load_dataset('isobench/IsoBench', 'math_breakpoint', split='validation')
+dataset_parity = load_dataset('isobench/IsoBench', 'math_parity', split='validation')
+dataset_convexity = load_dataset('isobench/IsoBench', 'math_convexity', split='validation')
+dataset_breakpoint = load_dataset('isobench/IsoBench', 'math_breakpoint', split='validation')
 ```
 
 ### Algorithms
@@ -348,9 +348,22 @@ Each task has 128 dev samples under the validation split.
 - `id`: a `string` feature
 
 #### Maxflow
-
+- `image`: a PIL Image feature
+- `source_node`: a `unit32` feature, denoting the index of the source node
+- `source_node_color`: a `string` feature, denoting the color of the `source_node` rendered in the `image`
+- `sink_node`: a `unit32` feature, denoting the index of the sink node
+- `sink_node_color`: a `string` feature, denoting the color of the `sink_node` rendered in the `image`
+- `adjacency_matrix`:  a `string` feature, a string of an 2d array representing the adjacency matrix of a graph. The value in entry (i,j) denotes the capacity of flowing from node `i` to node `j`.
+- `label`: a `uint32` feature
+- `id`: a `string` feature
+  
 #### Isomorphism
-
+- `image`: a PIL Image feature, consisting of two graphs `G` and `H`
+- `adjacency_matrix_G`:  a `string` feature, a string of an 2d array representing the adjacency matrix of graph `G`
+- `adjacency_matrix_H`:  a `string` feature, a string of an 2d array representing the adjacency matrix of graph `H`
+- `label`: a `bool` feature, with possible values including `True` (graphs `G` and `H` are isomorphic) and `False` (not isomorphic)
+- `id`: a `string` feature
+  
 ### Games
 
 [More Information Needed]