Answer the following questions:

1. How many arcs (edges) are there?

2. How many acyclic paths are there from node a to node d ? What are they?

3. What are the predecessors of node b?

4. What are the successors of node b?

5. How many simple cycles are there? List them. Do not repeat paths that differ only in the starting point.

6. List all the non-simple cycles of length up to 7.

7. Find all the paths from a to d that do not repeat any node.

8. How many simple cycles are there that include all six nodes? List these cycles.

9. What are the neighbors of node a?

Depth First Search

10. Call DFS(d, G) to generate the list of all possible vertices that are reachable from d.

Maximum Flow:

Follow Ford-Fulkerson method to find the maximum flow of this given flow-network. (source node: 1 and sink node: 6)