/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 vote168 views3 answers
Mail mailer
Python
6 votes192 views3 answers
Django filter install
Python
0 vote207 views1 answer
Finding the maximum element from a matrix with Python numpy.argmax()
Python
0 vote204 views1 answer
Pandas to json without index
Python
4 votes213 views1 answer
Pandas transpose
Python
1 vote230 views1 answer
Wtf forms required
Python
0 vote213 views1 answer
Seaborn line chart set fig size
Python
0 vote196 views1 answer
Python print numbers 1 to 10 in one line
Python
14 votes193 views3 answers
Getting ip address based on phone number python
Python
0 vote193 views1 answer
Custom auth django channels
Python