/Python/Networkx - unique combinations of paths

Networkx - unique combinations of paths

# Unique combinations of paths
gg = nx.complete_graph(6)         # Create a complete graph
nx.draw(gg, with_labels = True)   # Plot graph
source = 0                        # Set source node
target = 3                        # Set target node
gg.remove_edge(0, 3)

paths = nx.all_simple_paths(gg, source=source, target=target, cutoff=5)    # Find all paths between two nodes

# Method 1
s = set(map(frozenset, paths))                                             # Remove duplicates {frozenset({0, 3, 4}), frozenset({0, 2, 3})...  
non_redundant_paths = [[source, *[*p-{source,target}],target] for p in s]

# Method 2
non_redundant_paths = []
seen = []
for p in paths:
    if set(p) not in seen:                 # Keep track of the seen ones using a set
        non_redundant_paths.append(p)
        seen.append({*p})
        
print(non_redundant_paths)

Source: stackoverflow.com

Similar codes

3 votes133 views5 answers
Remove unnamed 0 column pandas
Python
0 vote75 views1 answer
Goto statement in python geeksforgeeks
Python
108 votes125 views6 answers
Dataframe sort by column
Python
0 vote127 views1 answer
Debugging pytest in vscode
Python
2 votes116 views1 answer
Django override delete
Python
0 vote106 views1 answer
Np.arange and np.linspace difference
Python
0 vote120 views1 answer
Comtypes python
Python
0 vote99 views1 answer
Find index corresponding to maximum value pandas
Python
0 vote126 views5 answers
TypeError: ‘float’ object is not callable
Python
0 vote131 views2 answers
Use reshape in python with zeros
Python