There are two path counting algorithms:

a. to count the number of paths from a node to another;

b. to count the number of paths from one node to another while some regular constraint is placed on the paths to be counted.

3. Let G be a graph that may contain loops and hence, the number of paths from a designated start node to a designated end node may be infinite. Unfortunately, you usually cant say one infinite number is larger than another. Here is the problem: sketch a way to compare the number of paths in two graphs (that both may contain loops). (Hint: google perron, graph, path count).