/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 vote140 views2 answers
Python csv reader skip header
Python
0 vote151 views1 answer
How to connect wifi using python
Python
0 vote136 views1 answer
Pandas df count values less than 0
Python
0 vote189 views1 answer
Cant import config python 3
Python
1 vote161 views1 answer
How to open dialog box to select folder in python
Python
1 vote128 views1 answer
Django celery results
Python
0 vote130 views1 answer
CharAt in Python
Python
0 vote131 views1 answer
Dataframe get index name
Python
0 vote135 views1 answer
Install python3 centos 7.8
Python
3 votes137 views1 answer
How to create a label in tkinter python
Python