/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 vote133 views1 answer
Check if array is monotonic python
Python
10 votes126 views10 answers
Python Program to capitalize a string
Python
3 votes159 views1 answer
Python get output of command to variable
Python
0 vote336 views1 answer
Np array blurring
Python
41 votes132 views2 answers
Python writing to csv file
Python
0 vote136 views2 answers
Sort list of string datetimes python
Python
5 votes134 views1 answer
Mongodb group by having
Python
0 vote135 views1 answer
How to check if a cell is empty in openpyxl
Python
0 vote139 views1 answer
Python check if more than 1 is true
Python
0 vote141 views1 answer
Demploy django in vps
Python