Hill's expanded diagram is a systematic way of searching paths in the diagram, and all the one-way cyclic paths were traced successfully (Fig. 4).
FINISH avoids deep recursion by limiting the number of contigs (default 15) on the searched path.
In ACO routing algorithms, multiple ants created by a node traverse the network to search paths between two nodes.
A famous graph search algorithm, called the breadth-first search (BFS) algorithm [ 33], in the graph theory was modified to search paths in a network.
To improve speed, Rcorrector does not attempt to correct solid positions, and gradually decreases the allowable number of corrections if the number of searched paths becomes large.
We have implemented in BiNoM a set of functions that allow users to select annotated nodes, select target nodes, and choose among three different options for searching paths (shortest paths, optimal and suboptimal shortest paths, all non self-intersecting paths).
Scouts use a Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO) approach for searching and path planning.
Figure 2 Box search path.
Figure 4 The search path of the 2DLOG search algorithm.
In this paper, we design a search path that attains a competitive ratio of 12.53853842…, and slightly improves the current best-known search path.
Given that all participants exhibited regularity in their search path, we were unable to explore whether a regular search path predicted higher accuracy or not.
