Abstract
Two algorithms to generate the set of corridor paths specified by a given parameter tuple were developed. The first algorithm works in a block-wise iterative fashion and has exponential space complexity. The second algorithm is a recursive generator with linear space complexity. The average time needed per path is approximately constant for both algorithms. Their implementation was successfully tested to conform with the path specifications and being exhaustive.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
