The specificity of our model is that it learns a given graph similarity metric, which is not provided in these datasets.
we use only the graphs from these datasets, computing the shortest path distances between all pairs of nodes using the algorithm of Johnson (1977).