/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

8 votes127 views6 answers
Declare variable in python
Python
3 votes133 views2 answers
Auticlicker python
Python
0 vote125 views1 answer
How a 16 mp camera looks like
Python
6 votes152 views2 answers
Max int value in python
Python
9 votes128 views1 answer
Print current dirfile dir python
Python
0 vote145 views1 answer
Type conversions in python
Python
2 votes157 views1 answer
Django create model from dictionary
Python Django
2 votes130 views3 answers
Python how to get directory of script
Python
4 votes156 views1 answer
Import sklearn.metrics from plot_confusion_matrix
Python
28 votes146 views3 answers
Round down a number python
Python