Displaying 1 result from an estimated 1 matches for "thesesearchedbranches".
2007 Mar 16
1
Fast lookup in ragged array
...t 200 nodes. It seems that a significant portion of the
computation time is spent looking up the current subgraph in the list
of searched subgraphs to see if it is redundant, and I'm wondering if
there's a faster way to do this.
Currently, the list of searched subgraphs is a list
(`theseSearchedBranches`) of unnamed numeric vectors. I'm checking
against the list using the following command:
if(list(v) %in% theseSearchedBranches){
cat(" Branch already searched: passing.\n\n")
return(NULL)
}
v is a sorted numeric, with length anywhere between 3 and 20...