/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

1 vote118 views1 answer
Python partial
Python
0 vote166 views1 answer
How to wait for loading icon to disappear from the page using selenium python
Python
4 votes122 views2 answers
Matplotlib plot title font size
Python
10 votes116 views1 answer
Python - convert a column in a dataframe into a list
Python
2 votes120 views1 answer
Python default input
Python
1 vote118 views6 answers
Code grepper
Python
0 vote144 views1 answer
Python inject into process
Python
2 votes118 views1 answer
Add two column values of a datframe into one
Python
0 vote124 views1 answer
List Comprehension iteration
Python
0 vote153 views1 answer
Python tuples number Multiplication
Python