/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

0 vote248 views1 answer
Python program to switch first and second characters in a string
Python
7 votes176 views3 answers
Discord.py level system
Python
0 vote277 views3 answers
Berlin
Python
0 vote160 views1 answer
Get id widget tkinter
Python
0 vote146 views1 answer
ValueError: invalid PNG header
Python
0 vote188 views1 answer
Take first n row of dictionary python
Python
26 votes205 views4 answers
Python send email with attachment
Python
9 votes178 views2 answers
Keras model save
Python
4 votes147 views2 answers
How to get the system time in python
Python
3 votes144 views1 answer
Ipython autoreload
Python