/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

17 votes174 views2 answers
Count lines in file python
Python
0 vote150 views1 answer
Date-fns difference in days
Python
0 vote143 views2 answers
Python c like struct
Python
2 votes142 views2 answers
The command
Python
0 vote194 views1 answer
How to install flask module in vscode
Python Flask
2 votes145 views2 answers
Add text to plot python
Python
0 vote146 views1 answer
Does np.random.randint have a seed
Python
0 vote144 views1 answer
StringIndexer pyspark
Python
0 vote156 views1 answer
Python pandas return column name of a specific column
Python
13 votes148 views5 answers
How to make a timer using python
Python