search

jacquesfize / GMatch4py

A graph matching library for Python
MIT License
192 stars 41 forks source link

What is the order of the costs in GraphEditDistance? #21

Closed emmanuelasso closed 3 years ago

emmanuelasso commented 4 years ago

Hi, in the readme it appears that:

ged=gm.GraphEditDistance(1,1,1,1) # all edit costs are equal to 1

The costs are adding and removing nodes and edges? but what is the order of the costs?

olhakholod commented 4 years ago

Hi, the order is the following:

node deletion = 1, node insertion = 1, edge deletion = 1, edge insertion = 1