Compute the traversal graph TG(S,G,I,BTRUE) and start and finish sets Ts and Tf, where I is the identity map and BTRUE returns true for all graph elements. @throws TraversalException if the resulting traversal graph is empty.
Compute the traversal graph TG(S,G,I,BTRUE) and start and finish sets Ts and Tf, where I is the identity map and BTRUE returns true for all graph elements. @throws TraversalException if the resulting traversal graph is empty.
public TraversalGraph(ISimpleStrategy,IClassGraph);
public TraversalGraph(ISimpleStrategy,IClassGraph,INameMap,IConstraintMap);