/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 vote196 views1 answer
HTTP Error 403: Forbidden django account signup email
Python
4 votes185 views5 answers
Module 'datetime' has no attribute 'now' django
Python
0 vote218 views1 answer
Qspinbox value changed
Python
0 vote212 views1 answer
Python interpreter pip
Python
0 vote191 views2 answers
Problem 1 dot product python
Python
0 vote222 views1 answer
Tuto date and time python
Python
0 vote185 views1 answer
Matplotlib rc params
Python
0 vote176 views1 answer
Pygame tick time
Python
8 votes178 views1 answer
Créer des variable dynamiques python
Python
7 votes199 views2 answers
Python: remove duplicate in a specific column
Python