/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 vote245 views1 answer
Pandas separator are multiple spaces
Python
4 votes244 views1 answer
Server on python with address and port
Python
0 vote280 views1 answer
Tqdm for jupyter notebook
Python
4 votes243 views3 answers
List methods append in python
Python
0 vote255 views1 answer
Word counter python
Python
185 votes347 views6 answers
How to update pip in python
Python
7 votes238 views1 answer
// meaning in python
Python
0 vote264 views2 answers
Tkinter progresse bar color
Python
0 vote271 views3 answers
How to install idle on ubuntu 20.04
Python
1 vote253 views1 answer
Requirements.py for flask
Python