Advanced Search

Question: Paths in a directed graph

Question:Paths in a directed graph

Nikhil Sohonie 4 Maple
April 23 2007
0
Hi, I am using the networks package to try to find out the total number of paths between two vertices of a graph. The graph I am interested in is basically a square grid with a diagonal from the lower left to the upper right. I want to find the total number of paths from the lower left vertex to the upper right vertex according to the following rules. 1. Can only move right 2. Can only move up 3. Can only move up the diagonal. So I wrote a procedure that would produce such a directed graph for any n. For any n the graph has n^2 vertices but only edges that meet the criterion given above. How do I continue from here to figure out the total number of paths between two vertices? The path function fails no matter which vertices I chose. I will list out the procedures I used in the next post. They both work fine. I just need to know how to proceed from here to calculate the paths.
Please Wait...