residuaalikuvaajien
Residuaalikuvaajien, a Finnish term, translates to residual graphs in English graph theory. A residual graph is a concept used in algorithms for network flow problems, such as the Ford-Fulkerson method and its variations. When considering a flow network, which consists of a directed graph with capacities on its edges, a residual graph is constructed to represent the remaining capacity on each edge and the possibility of reversing flow.
In a residual graph, for every edge (u, v) in the original graph with capacity c(u, v)
The residual graph is dynamic; it changes as flow is augmented through the network. Algorithms like Ford-Fulkerson