Skip to main content
. 2020 Jul 11;48(14):7690–7699. doi: 10.1093/nar/gkaa583

Figure 3.

Figure 3.

Here, we compare the local neighbourhoods of node u in graph G and node Inline graphic in graph H. In this simple example, graphs only have one of two possible edge types, red and black. We compare the distributions of edge labels at each distance from the source nodes (u and Inline graphic) to obtain the final similarity value K(u, Inline graphic).