/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 vote199 views2 answers
Value is not a valid dict (type=type_error.dict) response_model fastapi
Python
2 votes194 views1 answer
How to downgrade a package python
Python
3 votes295 views1 answer
Django user group check
Python Django
0 vote143 views1 answer
Django trim string whitespace
Python
0 vote193 views1 answer
Optimize images using pillow
Python
5 votes209 views4 answers
Matplotlib space between subplots
Python
0 vote201 views1 answer
Get duplicate and remove but keep last in python df
Python
0 vote218 views3 answers
Translate python to c
Python
33 votes192 views6 answers
Merge dataframe
Python
0 vote214 views1 answer
Limpiar consola en python
Python