A simple modification of a method presented by Doreian (1974) adapts it for finding, in a network or “valued graph”, the maximum level paths which do not have cycles or repeated points and which have a specified maximum length.
Notes
School of Social Sciences, The Flinders University of South Australia, Bedford Park, South Australia, 5042.