What were you supposed to use instead? My impression is that dynamic programming is sometimes sluggish but often better than the alternatives.
Generally, shortest path algorithms rely on dynamic programming for a reasonable solution. Examples of include the Traveling Salesman.