Step 3 deletes selected edges in a copy of the class graphs. 
This allows us to express which edges or nodes are not allowed to be in 
the desired path set. 

Steps 4 and 5 introduce a temporary source and temporary target node.
The idea is that the path set can be computed by taking all the paths 
from the source to the target node in the traversal graph.


Algorithm 2: