/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 vote299 views1 answer
Print treelib.Tree
Python
0 vote316 views1 answer
How to check if a list is nested or not
Python
1 vote317 views2 answers
Django queryset unique values
Python
1 vote318 views1 answer
Check if queryset is empty django template
Python
0 vote348 views1 answer
How to save multiple choices in django site:stackoverflow.com
Python Django
0 vote324 views1 answer
Load image metadata with pil
Python
6 votes331 views1 answer
Select closest number in array python
Python
0 vote317 views1 answer
Get the last element from the list
Python
32 votes306 views1 answer
How to add a column to a pandas df
Python
0 vote331 views1 answer
Python timeout exception
Python