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.