/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 votes160 views1 answer
Python use tqdm with concurrent futures
Python
25 votes120 views4 answers
Python extract specific columns from pandas dataframe
Python
29 votes163 views2 answers
Python string upper method
Python
29 votes220 views6 answers
Create empty pandas dataframe
Python
0 vote155 views1 answer
Description of imdb dataset python
Python
6 votes147 views2 answers
How to add mouse button in pygame
Python
1 vote188 views1 answer
Comment choisir tout les caractère d'un str sauf les deux dernier python
Python
10 votes146 views5 answers
Zip python
Python
3 votes176 views3 answers
Python codes
Python
1 vote154 views1 answer
Python multiply one column of array by a value
Python