Message Boards Message Boards

GROUPS:

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

Posted 1 year ago
1471 Views
|
1 Reply
|
1 Total Likes
|

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.

Attachments:

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.

Reply to this discussion
Community posts can be styled and formatted using the Markdown syntax.
Reply Preview
Attachments
Remove
or Discard

Group Abstract Group Abstract