/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 vote337 views1 answer
Template tag django
Python Django
1 vote277 views1 answer
How to find and replace all the punctuation in python strings
Python
0 vote284 views1 answer
Get unique words from pandas dataframe
Python
8 votes316 views3 answers
Max value pandas
Python
0 vote290 views1 answer
Django send_mail not working in testcase
Python
0 vote290 views1 answer
Pandas add quantile columns
Python
25 votes297 views6 answers
Playsound python
Python
0 vote304 views1 answer
How to separate url from text in python
Python
0 vote294 views1 answer
See python function details in vscode
Python
0 vote263 views1 answer
Python ctypes maximize window
Python