[DOCUMENTATION | DELAYED] Explanation about ShortestPathOneToMany about ch HOT 1 OPEN

There is no clever trick. This is all about just reducing amount of allocations as you noticed.

reusing the data structures across iterations

Yes. It's just used in relaxation functions and nothing special:

// ...
// cid - ID of queue for certain target node
if forwProcessed[temp] != cid || queryDist[temp] > alt {
  queryDist[temp] = alt
  prev[temp] = vertex.id
  forwProcessed[temp] = cid
  node := &bidirectionalVertex{
	  id:        temp,
	  queryDist: alt,
  }
  heap.Push(forwQ, node)
}
// ...

We are not planning to make section about this function currently, since it's not a big optimization (at all, lol).
When we have some really useful optimization we'll make docs for it for sure.

Marking this issue as delayed for now

from ch.