Route determination applications based on the Bellman-Ford algorithm are widely adopted because they handle weighted graphs iteratively, including negative weights. However, testing that only checks output correctness, such as black-box testing, cannot guarantee that every execution path, particularly inside the nested loops of the edge-relaxation process, behaves as intended, so hidden logical errors may remain undetected. This study verifies the structural correctness of the nearest delivery-distance module of a web-based package delivery application that implements the Bellman-Ford algorithm, using white-box testing with the basis path technique: flowgraph construction, cyclomatic complexity calculation, independent path determination, and the design and execution of test cases. The flowgraph consists of 15 nodes, 18 edges, and 4 decision nodes, giving a cyclomatic complexity V(G) of 5, which is classified as simple and low-risk; five independent paths cumulatively cover all 18 edges. Executing the five path-based test cases, together with one supplementary test on a larger sample graph, produced outputs identical to the expected results in every case, so the implementation is structurally valid within the scope of the basis path coverage criterion. Nested loops do not by themselves raise V(G): the number of independent paths depends on the number of decision points rather than on the number of iterations, so V(G) should not be read as a proxy for the O(|V||E|) running time of Bellman-Ford. Path-based testing additionally reached three paths, namely an empty edge set, negative-weight cycle detection, and an inner loop that is never entered, which the earlier black-box testing had not exercised. The five-path test set provides a replicable structural testing procedure for similar graph algorithm implementations, to be complemented by loop and boundary testing.