Click here to Skip to main content
15,895,142 members
Articles / General Programming / Algorithms

Finding non-cyclical paths between arbitrary pairs of nodes

Rate me:
Please Sign up or sign in to vote.
4.81/5 (16 votes)
7 Jun 2012Public Domain4 min read 48.4K   411   43  
A recursive algorithm to find all paths between communicating network nodes.

By viewing downloads associated with this article you agree to the Terms of Service and the article's licence.

If a file you wish to view isn't highlighted, and is a text file (not binary), please let us know and we'll add colourisation support for it.

License

This article, along with any associated source code and files, is licensed under A Public Domain dedication


Written By
Software Developer http://technical-recipes.com
United Kingdom United Kingdom
Software Engineer who has worked on projects in telecommunications, industrial robotics and image processing.

My home page is http://technical-recipes.com

Comments and Discussions