Further speed optimizations beyond our current implementation with FG and SP Cypher queries on databases with multiproduct and ambiguous reactions removed from the database are possible. For some molecules, the rate limiting step is enumerating routes after post-processing the synthesis graph. Specifically, the tail end distribution containing outliers of Figure S?? takes longer than querying the database for the synthesis graph. This is due to computing the edge betweeness centrality heuristic can become rate limiting in larger graphs. One approach is to use again a shortestPath algorithm instead of enumerating all routes in the graph such as bi-directional BFS again or Djikstra after all post-processing such as removal of artifacts like child reactions of target molecule, and any parent reactions of starting materials and the iterative removal of leaf substances not in inventory.