docs: def left_node_intersection_join(g, h):
      """Take the intersection over two graphs.
  
      This intersection of two graphs is defined by the union of the sub-graphs induced over the intersection of their nodes
  
      :param BELGraph g: A BEL graph
      :param BELGraph h: A BEL graph
      :rtype: BELGraph
  
      Example usage:
  
      >>> import pybel
      >>> g = pybel.from_path('...')
      >>> h = pybel.from_path('...')
      >>> merged = left_node_intersection_join(g, h)
      """
      intersecting = set(g).intersection(set(h))
  
      g_inter = subgraph(g, intersecting)
      h_inter = subgraph(h, intersecting)
  
      left_full_join(g_inter, h_inter)
  
      return g_inter