docs: public int initSearch(int centerNode, int sourceNode, int sourceEdge) {
          reset();
          this.sourceEdge = sourceEdge;
          this.sourceNode = sourceNode;
          this.centerNode = centerNode;
          setInitialEntries(sourceNode, sourceEdge, centerNode);
          // if there is no entry that reaches the center node we won't need to search for any witnesses
          if (numPathsToCenter < 1) {
              reset();
              return 0;
          }
          currentBatchStats.numSearches++;
          currentBatchStats.maxNumSettledEdges += maxSettledEdges;
          totalStats.numSearches++;
          totalStats.maxNumSettledEdges += maxSettledEdges;
          return dijkstraHeap.getSize();
      }