Directed network edge and reachability worksheet StatMedAnalysis | 16 November 2026 Document additive costs and missing edges before computing routes. List edges explicitly. Distinguish no edge from a genuine zero-cost transition. Validate route totals and unreachable pairs. Use synthetic or aggregate values only. Duplicate the blank row for additional records. From node | To node | Cost/unit | Allowed direction | Source/version | Missing edge convention | Constraint ________ | ________ | ________ | ________ | ________ | ________ | ________ Fictional example: A to B costs 2 and B to C costs 3, making total 5; these edges alone do not permit C to A. Completed by / version / date: _____________________ Unresolved discrepancies and action: _____________________