Code covered by the BSD License  

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

4.2

4.2 | 5 ratings Rate this file 29 Downloads (last 30 days) File Size: 2.04 KB File ID: #27438

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

by

 

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

| Watch this File

File Information
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.

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
abhishek.piku@gmail.com
Ph. No.: 00 91 99 86 11 58 91

MATLAB release MATLAB 7 (R14)
Tags for This File   Please login to tag files.
Please login to add a comment or rating.
Comments and Ratings (5)
23 Jan 2014 kaka  
21 Jun 2011 siamak

your code is so weak

24 Aug 2010 Tanyer Alan  
09 Jul 2010 Erdal Bizkevelci  
20 May 2010 Abhishek Chakraborty  

Contact us