Navigating INFO: Advanced Processing
Tim Haithcoat · MOspace Institutional Repository (University of Missouri) · 1999
This presentation deals with data structures and algorithms not inherent to ARC. It is mostly concerned with line coverages (AATs). Topics include: node-arc lists (NAL), NODE Valence tables (VAL), dangling and orphan ARCs, travel time to a node (ALLOCATE), polygon neighbor list, and backwalking a least-cost path.