/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

0 vote176 views2 answers
Funcion que reciba una cadena en python
Python
0 vote225 views1 answer
Fetch last record from django model
Python Django
0 vote188 views1 answer
Django populate form from database
Python Django
0 vote175 views1 answer
Create new dataframe from existing data frame python
Python
1 vote184 views1 answer
Import "django.core.urlresolvers" could not be resolved
Python
0 vote178 views1 answer
Python logging to syslog linux
Python
0 vote186 views1 answer
Django order by foreign key count
Python
54 votes239 views6 answers
Conda create environment python 3.6
Python
0 vote176 views1 answer
Django test postgres extensions intarray
Python
178 votes205 views6 answers
Read file python
Python