PyDiGraph.insert_node_on_out_edges_multiple(node, ref_nodes, /)#

Insert a node between a list of reference nodes and all their successors

This essentially iterates over all edges out of the reference node specified in the ref_node parameter removes those edges and then adds 2 edges, one from ref_node to node and the other from node to the successor of ref_node. The edge payloads for the newly created edges are copied by reference from the original edge that gets removed.

  • node (int) – The node index to insert between

  • ref_nodes (int) – The list of node indices to insert node between