Class TopDownDFBacktrackPathEnumerator


  • public class TopDownDFBacktrackPathEnumerator
    extends PathEnumerator
    This program counts all paths in the graph by iteratively enumerating all paths. It uses depth first traversal to walk on the graph. WARNING: This can be very expensive on large graphs! It's not only potentially exponential in terms of the traversal, but also in terms of the space to store each path!
    Author:
    Ben Holland
    • Constructor Detail

      • TopDownDFBacktrackPathEnumerator

        public TopDownDFBacktrackPathEnumerator()
      • TopDownDFBacktrackPathEnumerator

        public TopDownDFBacktrackPathEnumerator​(boolean considerShortCircuitPaths)