priba / aproximated_ged

Bunch of aproximated graph edit distance algorithms.

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

edit protocol (edit path)?

Sciss opened this issue · comments

commented

Hi there. Thanks for making this project available. Can I use it to get the actual editing steps ("edit path") involved?

For example, say I load from the example the graphs for letters A (g1) and E (g2), and I use VanillaHED. Then

ged.ged(g1, g2)
(2.8510674059664303, (array([0, 1, 2, 5, 4]), array([0, 1, 2, 4, 4, 3])))

From those two arrays, can I deduce the edit operations? Like which nodes and which edges were inserted and deleted?