/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

67 votes326 views4 answers
How to know the version of python using cmd
Python
1 vote318 views1 answer
Python groupby sum single columns
Python
0 vote315 views1 answer
CSRF verification failed. Request aborted.
Python
1 vote312 views1 answer
Vscode pylint missing module docstring
Python
0 vote353 views3 answers
Flask models
Python Flask
24 votes351 views6 answers
Python sort dictionary by key
Python
0 vote324 views1 answer
How to convert word to number in python pandas
Python
0 vote346 views1 answer
How to for loop length print in python
Python
0 vote306 views1 answer
Matplotlib radial averaging
Python
35 votes339 views6 answers
How to create an array in python
Python