Dear all Any suggestions or hints as to how I might approach the following problem would be gratefully received.
I have a large tree G whose edges have a discrete attribute "type", for example an integer. I want to merge two subtrees of G of the form "a source node plus its descendents" in a way that respects the edge types. That is to say I want to merge pairs of nodes for which the paths from their respective source node have the same sequence of edge types. When I can identify the node pairs I can use contract.vertices, but how do I identify the node pairs? David
_______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
