Get all the simple possible paths between two points in an undirected graph

nehalahmed2014 · July 14, 2019, 9:49am

I wrote a code to extract all the simple possible paths between two points in an undirected graph and mathematica takes too long running time and doesn’t yield any results/output. Any idea how to deal with this problem?
I am attaching my code.

Possible paths in terms of edges and not vertices.nb (157 KB)

ahmed · July 14, 2019, 4:36pm

It is because specifying the length of the path to infinity with a largely connected graph like yours, try to use a number instead and you will get your results.

Topic		Replies	Views
Get all possible simple paths between two nodes in a large network? Questions graphs-and-networks	1	9512	July 27, 2019
How to find all possible paths tracing as many edges between two vertices? Questions computer-science , engineering , mathematica , discrete-mathematics , graphs-and-networks , numerical-computation	1	15596	October 9, 2015
How do I get all possible paths in terms of edges, and not vertices? Questions engineering , operations-research , mathematica , discrete-mathematics , graphics-and-visualization , graphs-and-networks , statistics-and-probability	5	19189	September 29, 2015
Find all paths in a graph when removing one node of the graph at a time Questions computer-science , data-science , engineering , calculus , graphs-and-networks , numerical-computation	4	7769	April 11, 2020
Number of paths from Start to End through each node Questions operations-research , graphs-and-networks	5	9753	August 14, 2020

Get all the simple possible paths between two points in an undirected graph

Related topics