/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

2 votes166 views6 answers
K
Python
0 vote135 views1 answer
Python move all txt files
Python
1 vote174 views2 answers
Number of columns with no missing values
Python
0 vote171 views1 answer
Add prefix to names in directory python
Python
189 votes270 views10 answers
New Year's Eve
Python
0 vote188 views1 answer
Python ordereddict reverse
Python
2 votes173 views1 answer
Tkinter execute function on enter
Python
1 vote166 views1 answer
T-Test Comparison of two means python
Python
3 votes164 views2 answers
Pygame change logo
Python
0 vote181 views1 answer
Def dict(d)
Python