/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

12 votes346 views5 answers
Turtle write
Python
0 vote327 views1 answer
Call methods from within a class
Python
2 votes376 views1 answer
Run flask application in development mode stack overflow
Python
1 vote331 views1 answer
Python 2.7 check if variable is none
Python
0 vote344 views1 answer
How to write x in terms of y sympy
Python
30 votes361 views5 answers
Generate random float python
Python
0 vote374 views1 answer
Contextlib closing python file
Python
0 vote361 views1 answer
Return the key-value pairs in this RDD to the master as a dictionary.
Python
1 vote383 views1 answer
Django model choice field from another model
Python Django
0 vote355 views1 answer
Create a list of the keys in python dictionary
Python