Delivers prescriptive analytics capabilities and decision intelligence to improve decision-making.
Originally posted by: arronlee11
1. Are all shortest path problems NP hard?
2. Is the classical shortest path problem NP hard?
The shortest path problem with non-negative edge weights can be solved in polynomial time and is thus not NP hard.