/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

4 votes117 views1 answer
Python gt index in for cycle
Python
0 vote111 views1 answer
Monkey patching in python
Python
0 vote115 views6 answers
Gcd
Python
0 vote103 views1 answer
Isapha
Python
57 votes120 views6 answers
Python environment
Python
0 vote116 views1 answer
Generate 3 random integers between 100 and 999 which is divisible by 5
Python
-1 vote122 views1 answer
Inverse matrix gauss python
Python
-1 vote130 views1 answer
Add column python list
Python
7 votes135 views2 answers
Create the dataframe column based on condition
Python
1 vote61 views1 answer
Django admin auto generate slug
Python