Message Boards Message Boards

0
|
4499 Views
|
1 Reply
|
2 Total Likes
View groups...
Share
Share this post:

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

Posted 5 years ago

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:
POSTED BY: Nehal Elshaboury

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.

POSTED BY: Ahmed Elbanna
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