Residual Network

A "fake" network constructed from real network considering the flow in two ways, remaining flow capacity, and current flow capacity…

Definition of Dynamic Programming

Copy from wikipedia

dynamic programming is a method for solving a complex problem by breaking it down into a…

Defintion of Divide and Conquer

Divide the problem into smaller problem, use the result of the small problems to form the result of the bigger problem…

Relaxation

Each point has a known distance so far, if a vertex + distance to a particular point is shorter than the known distance of the point…

Definition

Minimum spanning tree is defined as given graph(G) which a set of vertexes and edges with weights. Find a path which connects all vertexes…