dynamic programming

2 articles · All tags

• Dynamic Programming
  An optimization technique that solves problems by combining solutions to overlapping subproblems and storing intermediate results to avoid recomputation.
• Bellman–Ford Algorithm
  A single-source shortest path algorithm that handles negative edge weights and detects negative cycles, running in O(V×E) time.