/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 vote253 views1 answer
Python bangla packages
Python
0 vote192 views1 answer
Get file in file zip python
Python
0 vote172 views1 answer
Find no of 1's in a binary number
Python
2 votes201 views1 answer
Read database pandas
Python
1 vote242 views1 answer
Python get os cores
Python
0 vote233 views3 answers
How to create a sub project in django
Python
3 votes168 views2 answers
Numpy find where max element ist
Python
2 votes186 views1 answer
Python no module named
Python
0 vote202 views1 answer
Return an RDD created by coalescing all elements within each partition into a list.
Python
1 vote183 views1 answer
Message tags in django
Python