In contrast, for Greedy, the fraction of nodes possessing a minimum path length of greater than 4 rapidly decays, and the fractions of nodes possessing minimum path lengths of 1, 2, 3, and 4 increases the fastest. Unlike for the Passerini reaction dataset, for the Strecker reaction dataset, the fraction of nodes near the goal node is not small, indicating that the Strecker reaction's path network is more straightforward for navigation, and Greedy's search performance strengthens. For Uniform, although the fractions of nodes possessing minimum path lengths of 1 and 2 only increase to a level comparable to those of counterpart nodes for Random, Uniform's approach shows stronger node selection near the goal node at an early iteration stage, similar to that shown in Figure , albeit slower than Greedy's node selection near the goal node, corresponding to moderate goal finding.