code: def predicates(G: Graph, n: Node) -> Set[TriplePredicate]:
      
      return predicatesOut(G, n) | predicatesIn(G, n)
docs: redicates(G, n) is the set of predicates in neigh(G, n).
  
          predicates(G, n) = predicatesOut(G, n) ∪ predicatesIn(G, n)