/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 vote232 views1 answer
Qcombobox remove all items
Python
8 votes233 views3 answers
How to set default python version in macos
Python
0 vote231 views1 answer
Find common string in two strings python
Python
0 vote221 views4 answers
Pip django graphql
Python
0 vote245 views2 answers
Pandas replace non numeric values with 0?
Python
0 vote221 views1 answer
Cos2x
Python
-2 votes228 views2 answers
Convert list of list to list python
Python
17 votes176 views3 answers
Get last row of dataframe
Python
9 votes195 views1 answer
Python string methods
Python
12 votes230 views3 answers
How to install dependencies python
Python