This observation provides a plausible explanation as to how the presence of multiproduct reactions can negatively affect the route-finding performance. Breadth first search algorithm has a known time complexity of O(b d ) . Due to an increasing number of out going edges which increases the branching factor , this leads to polynomial increase in time. Additionally, the increased number of shortest paths will increase the number of combination graphs to enumerate, at the expense of the SynGPS algorithm performance.