Description: 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.
To Search:
File list (Check if you may need any files):
PathFinder.m
license.txt
Download