ABSTRACT
Examples of these types of problems are: shortest path problems, maximum flow problems, and minimum spanning tree problems.
24.2 Graphs A graph is used as a visual representation of a network. A graph consists of a
finite set of nodes (also known as vertices) and a finite set of arcs that connect pairs of nodes. A directed arc connects an ordered pair of vertices; if an arc starts at node P (head) and ends at node Q (tail), it is denoted as (P,Q). An arc will typically have an associated weight or length.
