/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

4 votes128 views2 answers
How to reinstall a python package
Python
10 votes137 views6 answers
Variable in python
Python
11 votes132 views2 answers
Pandas left join
Python
1 vote141 views1 answer
Python program to give shop name
Python
0 vote142 views1 answer
Get element from string with deliminator python
Python
0 vote148 views1 answer
Numpy how to apply interpolation all rows
Python
1 vote141 views1 answer
Print(\'Test set predictions:\\n{}\'.format(y_pred))
Python
5 votes126 views6 answers
Joe biden
Python
8 votes130 views2 answers
Firefox selenium python
Python
114 votes121 views6 answers
Python print to file
Python