The graph above is for an object which is thrown vertically upwards with an initial velocity of 20 m/s. In the time period 0-2 seconds – the object decelerates from 20 m/s to 0 m/s.

At their core, graph matching seeks to identify an optimal correspondence between the nodes of two graphs, while edit distance algorithms measure the minimum number of operations—such as ...