/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 vote195 views1 answer
List loop get previous element
Python
14 votes192 views1 answer
Python access global variable
Python
7 votes225 views2 answers
Python cd to directory
Python
0 vote230 views1 answer
Python quiet future warning
Python
34 votes190 views5 answers
Pandas max columns
Python
0 vote210 views2 answers
Best computer language
Python
0 vote183 views1 answer
Pandas chesk if object is string or tuple
Python
0 vote196 views1 answer
Delete rows in a table that are present in another table pandas
Python
0 vote187 views1 answer
Clear All the Chat in Discord Channel With Bot Python COde
Python
0 vote207 views2 answers
2)Write a function that checks whether a number is in a given range (inclusive of high and low) python
Python