/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

3 votes102 views1 answer
Pandas merge all csv in a folder
Python
0 vote109 views1 answer
Create array with unknown size in python
Python
0 vote111 views1 answer
Python sum over specific indexes
Python
4 votes123 views1 answer
Any python
Python
4 votes137 views6 answers
Python or in if statement
Python
4 votes106 views2 answers
Python check if exe is running
Python
3 votes98 views4 answers
List in pythom
Python
1 vote109 views1 answer
How to check if its later than python
Python
0 vote104 views1 answer
Maximum number of charectors allowed for a string variable in python
Python
0 vote101 views2 answers
Read one column pandas
Python