/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 votes246 views1 answer
Python project tutorial
Python
10 votes162 views4 answers
Count values pandas
Python
0 vote261 views1 answer
TypeError: 'LazyCorpusLoader' object is not callable
Python
1 vote231 views2 answers
Cannot import name 'imputer' from 'sklearn.preprocessing'
Python
0 vote176 views1 answer
How to get all links from a google search using python
Python
5 votes161 views5 answers
Python space separated input
Python
3 votes196 views1 answer
Local testing server Python
Python
0 vote230 views1 answer
Filter dataframe with a list of index
Python
10 votes181 views4 answers
Discord.py events
Python
49 votes138 views3 answers
Web scraping python
Python