Algorithm Design
M. T. Goodrich and R. Tamassia
John Wiley & Sons
Solution of Exercise C-7.9
We will describe two solutions for the ight scheduling problem.
1. We will reduce the ight scheduling problem to the shortest paths problem.
That means that we wi
Algorithm Design
M. T. Goodrich and R. Tamassia
John Wiley & Sons
Solution of Exercise C-6.19
First, even if it is not asked, we show that a connected directed graph has an Euler
tour, if and only if, each vertex has the same in-degree and out-degree (deg
Algorithm Design
M. T. Goodrich and R. Tamassia
John Wiley & Sons
Solution of Exercise C-7.7
We can model this problem using a graph. We associate a vertex of the graph
with each switching center and an edge of the graph with each line between two
switchi
Algorithm Design
M. T. Goodrich and R. Tamassia
John Wiley & Sons
Solution of Exercise C-14.8
Sort the elements of S using an external-memory sorting algorithm. This brings
together the elements with the same keys. One more scan through this sorted order