/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 vote256 views1 answer
Dist/Hist Plot Code in Seaborn
Python
4 votes267 views2 answers
Django composite primary key
Python
5 votes266 views3 answers
Text to binary python
Python
0 vote297 views1 answer
Pandas drop 1970
Python
14 votes251 views6 answers
How to print hello world in python
Python
5 votes271 views2 answers
Python turtle line thickness
Python
0 vote264 views1 answer
Change python 3.5 to 3.6 ubuntu
Python
19 votes288 views6 answers
Pandas change column order
Python
0 vote329 views1 answer
Limit characters in django template
Python Django
0 vote274 views1 answer
Torch root mean square
Python