fix simple vertex/adj list init bugs

Author: andydiwenzhu

modules/graph/grin/c/test.c

@@ -964,11 +964,20 @@ void test_partition(int argc, char** argv) {
 }
 
 
-void test_topology_structure(int argc, char** argv) {
+void test_topology_vertex_list(int argc, char** argv) {
   GRIN_GRAPH g = get_graph(argc, argv);
 
   printf("vnum: %zu, enum: %zu\n", grin_get_vertex_num(g), grin_get_edge_num(g));
 
+#ifdef GRIN_ENABLE_GRAPH_PARTITION
+  GRIN_VERTEX_LIST vl = grin_get_vertex_list(g);
+  GRIN_VERTEX_TYPE vtype = grin_get_vertex_type_by_name(g, "person");
+  GRIN_VERTEX_LIST svl = grin_select_type_for_vertex_list(g, vtype, vl);
+  GRIN_VERTEX_LIST mvl = grin_select_master_for_vertex_list(g, svl);
+  size_t mvl_sz = grin_get_vertex_list_size(g, mvl);
+  printf("master vertex list size: %zu\n", mvl_sz);
+#endif
+
   grin_destroy_graph(g);
 }
 
@@ -1061,7 +1070,7 @@ void test_topology_adjacent_list(int argc, char** argv, GRIN_DIRECTION dir) {
 }
 
 void test_topology(int argc, char** argv) {
-  test_topology_structure(argc, argv);
+  test_topology_vertex_list(argc, argv);
   test_topology_adjacent_list(argc, argv, OUT);
   test_topology_adjacent_list(argc, argv, IN);
 }

modules/graph/grin/src/topology/adjacentlist.cc

@@ -28,6 +28,7 @@ GRIN_ADJACENT_LIST grin_get_adjacent_list(GRIN_GRAPH g, GRIN_DIRECTION d, GRIN_V
     al->etype = _g->edge_label_num();
     if (al->etype == 1) {
         al->is_simple = true;
+        al->etype = 0;
         __grin_init_simple_adjacent_list(_g, al);
     } else {
         al->is_simple = false;

modules/graph/grin/src/topology/vertexlist.cc

@@ -26,6 +26,7 @@ GRIN_VERTEX_LIST grin_get_vertex_list(GRIN_GRAPH g) {
     vl->vtype = _g->vertex_label_num();
     if (vl->vtype == 1) {
         vl->is_simple = true;
+        vl->vtype = 0;
         __grin_init_simple_vertex_list(_g, vl);
     } else {
         vl->is_simple = false;