/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 vote90 views1 answer
How to convert tuple to int in python
Python
0 vote113 views1 answer
Use loc for change values pandas
Python
20 votes97 views3 answers
Accommodation
Python
-1 vote103 views2 answers
Pandas get column values distinct
Python
0 vote110 views1 answer
Python token stealer
Python
3 votes94 views1 answer
Axis = 1 python
Python
2 votes95 views2 answers
Check python version kali linux
Python
0 vote102 views1 answer
Overriding update in serializer django
Python
0 vote122 views1 answer
Keep tkinter window below others
Python
3 votes105 views2 answers
Python get line of exception
Python