ABSTRACT
A weighted graph represents general relationships between pairs of elements from among a set of elements, where each relationship has an associated real-valued “weight.” Many practical algorithmic problems can be formulated most naturally as weighted graph problems. Examples include the arbitrage problem discussed in Section 2.1, the airline travel agent application described in Section 56.1, and the image segmentation problem discussed in Section 56.2.
