/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 vote361 views1 answer
Prettify json in pycharm
Python
1 vote363 views1 answer
Installing packages from requirements.txt file
Python
1 vote332 views1 answer
How to trim mp4 with moviepy
Python
0 vote340 views1 answer
Check version of package poetry
Python
0 vote343 views2 answers
Python concatenation
Python
4 votes367 views5 answers
Python booleans
Python
23 votes371 views2 answers
Map function in python
Python
0 vote361 views1 answer
Create django model field based on another field
Python Django
0 vote337 views1 answer
Stutter function in python
Python
1 vote338 views1 answer
What is the size of cover in facebook
Python