Edges are removed and added again. As such their labels are not 'unchanged', and only contain what is in the resultant graph. So the below table, which is nice and consistent, needs rethinking.
|
Graph |
Rule Match Graph |
Rule Result Graph (New) |
Rule Result Graph (Existing) |
(How to achieve) |
| empty label |
empty |
any |
empty |
unchanged |
empty |
| empty label value |
void |
any |
empty |
unchanged |
void |
| empty label markset |
unmarked |
any |
empty |
unchanged |
unmarked / ¬ |
Edges in the rule's result graph are never 'existing' edges. They're always new, and so empty labels for them will always be empty.
Is this a problem? That their markset cannot be maintained (because their value can).
Edges are removed and added again. As such their labels are not 'unchanged', and only contain what is in the resultant graph. So the below table, which is nice and consistent, needs rethinking.
Edges in the rule's result graph are never 'existing' edges. They're always new, and so empty labels for them will always be empty.
Is this a problem? That their markset cannot be maintained (because their value can).