/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 vote267 views1 answer
Regex_2/_regex.c:50:10: fatal error: Python.h: No such file or directory
Python
0 vote262 views1 answer
How to display printed values without scientific notation python
Python
0 vote262 views4 answers
AttributeError: 'Database' object has no attribute 'remove'
Python
0 vote254 views1 answer
CSRF verification failed. Request aborted.
Python
2 votes255 views2 answers
Python PyQt5
Python
1 vote268 views1 answer
Django get model class from queryset
Python Django
38 votes252 views2 answers
Python check if path does not exist
Python
0 vote257 views1 answer
Python generate html
Python
0 vote250 views1 answer
Dump ML Model
Python
0 vote242 views1 answer
Tensorflow not installing error
Python