/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 vote140 views1 answer
Zero crossing rate python
Python
0 vote181 views1 answer
Django extend user model
Python Django
32 votes156 views6 answers
Remove space from string python
Python
1 vote144 views1 answer
How to minimize command console python
Python
40 votes172 views5 answers
Python print list as string
Python
0 vote149 views1 answer
Compile python folder
Python
0 vote153 views1 answer
Change date format on django templates
Python
2 votes154 views2 answers
Python sentence splitter
Python
4 votes146 views1 answer
Remove multiple space python
Python
0 vote104 views1 answer
Django include all columns admin show
Python