/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 vote695 views1 answer
Pandas calculate same day 3 months ago dateoffset
Python
0 vote264 views1 answer
Cannot import name 'counter' from 'collections'
Python
0 vote298 views1 answer
Check django channels with redis setup
Python Django
0 vote261 views1 answer
How to make a plt plot for na image bigger
Python
-1 vote246 views1 answer
Python code variable declaration
Python
1 vote255 views1 answer
How to loop back to try except python
Python
6 votes273 views6 answers
What is tuple in python
Python
-1 vote286 views2 answers
'FacetGrid' object has no attribute 'set_title'
Python
-1 vote279 views2 answers
Install unity on pop os
Python
0 vote264 views1 answer
Py urllib download foto
Python