FIND ALL THE POSSIBLE PATHS BETWEEN A START AND AN END NODE OF A GRAPH

Graph Theory, Finds all the possible paths between source and sink node.

In Graph Theory it is often required to find out all the possible paths, which can exist between a source node and a sink node.
So this function returns a all such possible paths, in a matrix format.
INPUTS:
1. 'X' Matrix: Form a Nx2 matrix, where N is the total number of 'Edges'. This Matrix will contain all the edges of the graph in the form of 'From Node' to 'To Node' fashion.
2. StartNode: Specify the Start or the Source Node.
3. EndNode: Specify End or the Sink Node.

Type: "PathFinder(X, StartNode, EndNode)" in the command window. Press Enter. An OUTPUT matrix will be generated where all the possible paths between the Source to Sink Node will be shown 'Row Wise'. A '0' will appear in row as an element to signify a blank space.

Note: The main Limitation of this function is that, as the total number of node increases, the execution time also increases. The total number of nodes is also limited to 20, due to memory considerations. I am still working on this, so any kind of suggestions/advice from your side will be highly appreciated.

Author-
Abhishek Chakraborty
[e-mail]
Ph. No.: 00 91 99 86 11 58 91