User Portlet
Discussions |
---|
I have written down a code that finds all possible simple paths (not repeating the same vertex and not duplicating the same path) between two nodes in a undirected graph in terms of vertices not nodes. The code works very well for small networks.... |
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. |
Yeah I got it now. I understood your comment. Thanks a million:) One last question please if we could re-shape the output to be only 1, 2, 62, 82, 96 without the number of ones in each column. couldn't thank you more. You really saved my day. |
Thank you very much. The code worked for me. |
Thanks a lot. The last code is very simple and worked great for me. I have another question please do you know a smart code to this part: a = pathmatrix[[All, 1]]; b = pathmatrix[[All, 2]]; c = pathmatrix[[All, 3]]; because I want to... |
For example, I have 3 matrices: ![enter image description here][1] ![enter image description here][2] ![enter image description here][3] I constructed a resultant matrix with first column input as A+B, second column as B+C and third column as... |
Hello Mohamed, I am also new to Mathematica. Can I ask you how did you calculate the path matrix (M) in your attached file? |
I have created a code that finds all possible paths from source node (1) to demand node (4), as per the attached file. I need to create a path matrix in which, number of rows is equivalent to the number of paths, and number of columns is equivalent... |