/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 vote261 views1 answer
Re python split()
Python
0 vote225 views1 answer
R named chr to dataframe
Python
0 vote290 views1 answer
Django action when create model
Python Django
1 vote240 views1 answer
For i in a for j in a loop python
Python
0 vote272 views1 answer
Return the number of elements in this RDD.
Python
1 vote243 views1 answer
Python converting phred quality score to number
Python
3 votes260 views1 answer
Load pandas from text
Python
0 vote231 views1 answer
Python multiple items in with statment
Python
0 vote238 views1 answer
Https://raw.githubusercontent.com/tim-yao/lighthouse-ci/d32f465bb6cda08ded4ce25c88c43a3103e4940a/.browserslistrc
Python
15 votes250 views4 answers
Pandas select column by index
Python