Professional Documents
Culture Documents
What is the least expensive airfare between some pair of cities involving
no more than two stops?
All of these problems (and many others) can be easily formalized as graph
problems.
A graph114 is a set of objects called nodes (or vertices) connected by a set of
edges (or arcs). If the edges are unidirectional the graph is called a directed
graph or digraph. In a directed graph, if there is an edge from n1 to n2, we refer
to n1 as the source or parent node and n2 as the destination or child node.