Permutes the given graph G=(V, E) by performing | E | * Q edge swaps.
Parameters: |
|
---|---|
Returns: | a permuted version of H (G is not modified) |
>>> import networkx as nx
>>> G = nx.Graph()
>>> G.add_edges_from([["G1", "G2"], ["G2", "G3"], ["G2", "G4"], ["G1", "G4"],
["G2", "G5"], ["G5", "G6"], ["G5", "G7"]])
>>> nx.draw_spectral(G, node_size=125, font_size=8)
>>> permute_network(G, 10)
See also: load_network(), multi_dendrix.permute.mutation_data.permute_mutation_data().
Notes: Uses the NetworkX double_edge_swap function.