This definition is recursive, and the starting point we choose is the semantic relatedness in the edge.
our structural semantic relatedness has two components: the neighbor term of the previous recursive phase which captures the graph structure and the semantic relatedness which captures the edge information.