
Abstract Algorithms 3—Dynamic Programming 305
1. Connection matrix gives path weightage
for each node pairs, if they are connected.
2. Dynamic programming solves a problem
bottom-up, going from a small sub-problem to
larger and larger sub-problems, till the whole
problem is solved, keeping the intermediate
results so that they need not be calculated
again and again.
3. Flow networks are modeled by graphs,
where vertices represent junctions and edges
represent “pipes’’ which carry some “material’’
and have a specifi ed maximum capacity.
4. Graph algorithms deal with graph
problems, which may model real-life situations
in a very diverse ...