But for the reason that some subnodes can be created at every step of BBS procedure, we present a data structure called cubeheap in this paper to implement OPEN list in order to speed up the search procedure
But for thereason that some subnodes can be created atevery step of BBS procedure, we present a datastructure called cubeheap in this paper toimplement OPEN list in order to speed up thesearch procedure