change 'label' to 'type' in markdown

README.md

@@ -81,14 +81,14 @@ width="700" alt="property graph" />
 
 #### Logical table of vertices
 
-Each type of vertices (with the same label) constructs a logical vertex
+Each type of vertices (with the same type) constructs a logical vertex
 table, with each vertex assigned with a global index inside this type
 (called internal vertex id) starting from 0, corresponding to the row
 number of the vertex in the logical vertex table. An example layout for
-a logical table of vertices under the label "person" is provided for
+a logical table of vertices under the type "person" is provided for
 reference.
 
-Given an internal vertex id and the vertex label, a vertex is uniquely
+Given an internal vertex id and the vertex type, a vertex is uniquely
 identifiable and its respective properties can be accessed from this
 table. The internal vertex id is further used to identify the source and
 destination vertices when maintaining the topology of the graph.
@@ -101,7 +101,7 @@ width="650" alt="vertex logical table" />
 The logical vertex table will be partitioned into multiple continuous
 vertex chunks for enhancing the reading/writing efficiency. To maintain
 the ability of random access, the size of vertex chunks for the same
-label is fixed. To support to access required properties avoiding
+type is fixed. To support to access required properties avoiding
 reading all properties from the files, and to add properties for
 vertices without modifying the existing files, the columns of the
 logical table will be divided into several column groups.
@@ -130,7 +130,7 @@ the storage.
 #### Logical table of edges
 
 For maintaining a type of edges (that with the same triplet of the
-source label, edge label, and destination label), a logical edge table
+source type, edge type, and destination type), a logical edge table
 is established. And in order to support quickly creating a graph from
 the graph storage file, the logical edge table could maintain the
 topology information in a way similar to [CSR/CSC](https://en.wikipedia.org/wiki/Sparse_matrix), that is, the

docs/libraries/cpp/examples/bgl.md

@@ -86,9 +86,9 @@ std::vector<graphar::Property> property_vector = {cc};
 auto group = graphar::CreatePropertyGroup(property_vector, graphar::FileType::PARQUET);
 
 // construct the new vertex info
-std::string vertex_label = "cc_result", vertex_prefix = "result/";
+std::string vertex_type = "cc_result", vertex_prefix = "result/";
 int chunk_size = 100;
-auto new_info = graphar::CreateVertexInfo(vertex_label, chunk_size, {group}, vertex_prefix);
+auto new_info = graphar::CreateVertexInfo(vertex_type, chunk_size, {group}, vertex_prefix);
 
 // access the vertices via the index map and vertex iterator of BGL
 typedef boost::property_map<Graph, boost::vertex_index_t>::type IndexMap;

docs/libraries/cpp/examples/snap-to-graphar.md

@@ -32,11 +32,11 @@ storage of the vertex information file.
 auto version = graphar::InfoVersion::Parse("gar/v1").value();
 
 // meta info
-std::string vertex_label = "node", vertex_prefix = "vertex/node/";
+std::string vertex_type = "node", vertex_prefix = "vertex/node/";
 
 // create vertex info
 auto vertex_info = graphar::CreateVertexInfo(
-    vertex_label, VERTEX_CHUNK_SIZE, {}, vertex_prefix, version);
+    vertex_type, VERTEX_CHUNK_SIZE, {}, vertex_prefix, version);
 
 // save & dump vertex info
 ASSERT(!vertex_info->Dump().has_error());