I have a graph where I have realized that some nodes are redundant with each other, and I'd like to replace the redundant nodes with a single node whose edges are the union of the original nodes' edges.
For example, suppose my graph has A->B->C, B->F, A->D->C, D->E. I've decided that I think B and D are redundant. I'd like to select B and D and perform a merge operation to replace B and D with a new node BD such that the resulting graph is A->BD->C, BD->F, BD->E.
Does yEd have such a feature?