Graph Edit Distance (GED) is a measure used to quantify the difference or similarity between two graphs. It is defined as the minimum cost required to transform one graph into another through a series of allowable edit operations. These operations typically include: 1. **Node Insertion**: Adding a new node to one graph. 2. **Node Deletion**: Removing a node from one graph. 3. **Edge Insertion**: Adding a new edge between two nodes in one graph.
New to topics? Read the docs here!