This paper proposes a novel recursive algorithm, towards finding all routing paths in an unidirectional flow- network.
The algorithm is recursive, so it provides a flexible approach comparing to iterative methods. Initially, all the paths from
source to destinations are identified and represented in a two-dimensional matrix. The recursive algorithm uses the
concept of blanking patterns, by identifying definite patterns of combinations of rows and columns in the two-dimensional
matrix.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.