/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 vote269 views2 answers
Python how to add 2 numbers
Python
0 vote299 views2 answers
Scrapy capture: Error downloading
Python
0 vote296 views1 answer
Noninspection access to protected member
Python
0 vote305 views1 answer
Python currnent time
Python
0 vote289 views1 answer
Python assert is datetime
Python
0 vote295 views1 answer
Format when turning float into string
Python
2 votes293 views1 answer
Python half of string
Python
4 votes290 views1 answer
How to write your first python program
Python
39 votes304 views6 answers
How to use a class in python
Python
2 votes304 views2 answers
Python code fpr fibon
Python