We perform breadth-first region growing on points with similar normals.
If some, but not all c k pebbles are collected, then continually try to collect more pebbles by performing breadth first searches repetitively until there are enough free pebbles on v j to cover edge e k.
Starting from a known insertion site represented by flanking k-mers (L, R), the module performs de novo assembly to attempt to reconstruct the inserted sequence between L and R. In a nutshell, a graph of contigs is constructed by performing breadth-first traversal of k-mers, starting from L. The traversal is halted when graph becomes too complex.
To find the subgraphs, we begin from a node with highest degree, and perform a breadth-first search from the node.
To obtain an ordering that satisfies the restrictions, perform a breadth-first traversal of T starting at the root.
Collect 6 pebbles for vertex v i by performing a breadth first search.
We do this by performing a breadth first traversal on q and d simultaneously.
Flag vertex v i as visited, and then attempt to collect c k pebbles for vertex v j by performing a breadth first search while holding the 6 free pebbles on v i in place.
collect_pebbles v, visited_vertices, pebbles_required) performs multiple breadth first searches to find free pebbles and pulls them onto the root vertex v of the search tree by reversing the search route that leads from vertex v to the free pebbles.
Then, it performs a breadth-first search on the entire file structure graph, inserting all pairs (p, l), where p is a structural path and l is a leaf node located on the path p, into the resulting structural multimap.
The algorithm performs a breadth-first search on the complete network.
