class_docstr: Implementation of SubHeterGraph in pgl.
  
  SubHeterGraph is inherit from :code:`HeterGraph`. 
  
  Args:
      num_nodes: number of nodes in a heterogeneous graph
      edges: dict, every element in dict is a list of (u, v) tuples.
      node_types (optional): list of (u, node_type) tuples to specify the node type of every node
      node_feat (optional): a dict of numpy array as node features
      edge_feat (optional): a dict of dict as edge features for every edge type
  
      reindex: A dictionary that maps parent hetergraph node id to subhetergraph node id.
class_docstr_tok: ["Implementation","of","SubHeterGraph","in","pgl",".","SubHeterGraph","is","inherit","from",":","code",":","`","HeterGraph","`",".","Args",":","num_nodes",":","number","of","nodes","in","a","heterogeneous","graph","edges",":","dict",",","every","element","in","dict","is","a","list","of","(","u",",","v",")","tuples",".","node_types","(","optional",")",":","list","of","(","u",",","node_type",")","tuples","to","specify","the","node","type","of","every","node","node_feat","(","optional",")",":","a","dict","of","numpy","array","as","node","features","edge_feat","(","optional",")",":","a","dict","of","dict","as","edge","features","for","every","edge","type","reindex",":","A","dictionary","that","maps","parent","hetergraph","node","id","to","subhetergraph","node","id","."]
docstr: Map the given subgraph node id to parent graph id.
  
  Args:
      nodes: A list of nodes in this subgraph.
  
  Return:
      A list of node ids in parent graph.
docstr_tok: ["Map","the","given","subgraph","node","id","to","parent","graph","id",".","Args",":","nodes",":","A","list","of","nodes","in","this","subgraph",".","Return",":","A","list","of","node","ids","in","parent","graph","."]
code: def reindex_to_parrent_nodes(self, nodes):
      """Map the given subgraph node id to parent graph id.
  
      Args:
          nodes: A list of nodes in this subgraph.
  
      Return:
          A list of node ids in parent graph.
      """
      return graph_kernel.map_nodes(nodes, self._to_reindex)
  
imports: import os
  import time
  import numpy
  import pickle
  import time
  import pgl.graph_kernel
  from pgl.graph import Graph, MemmapGraph
label_desc: Use image node_id 3 for calling the SubHeterGraph obj's underlying member method code with example usage: obj.reindex_to_parrent_nodes(nodes) and returns: graph_kernel