/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 vote318 views1 answer
Wait until exe terminates python
Python
60 votes321 views4 answers
Create exe from python script
Python
9 votes346 views1 answer
How to create a keylogger in python
Python
2 votes349 views1 answer
Python print show special characters
Python
0 vote390 views2 answers
Django swagger
Python Django
0 vote335 views1 answer
Extend tuple python
Python
0 vote355 views1 answer
Get first letter of each word in string python
Python
8 votes329 views1 answer
X = df.iloc[:, 1:]
Python
0 vote339 views1 answer
Remove hh:mm:ss from pandas dataframe column
Python
0 vote369 views1 answer
Python - oordinated universal time
Python