Oh, right! Now I understand much better. Thanks, Bruno. If you set multiEdges = True, though, the properties of the original edges are still not carried through to the newly created edges, AFAICS. So, the strategy is something like: Duplicate the graph, so you have a copy of the original one (call it clone_graph) and another one to contain the metanode (call it metanode_graph). mn = metanode_graph.createMetaNode(sg, False False) In clone_graph, iterate over the edges incident to the nodes in sg;...
I want to create a metanode from a subgraph. My main issue is that I need to compute properties of the edges incident to the metanode from the properties of the the "original" edges, incident to the individual nodes now grouped into the metanode. I thought it simplest to: clone my graph, and make all the changes in the clone. create the metanode (in the clone) as a singleton, with no edges, and then create new edges (in the clone) based on the properties of the incident edges in the original graph....