The problems on this page are individual steps for the crashing process. The problems on the following $2$ tabs are full crashing problems.

For each set of paths, list the possible ways to reduce the path distance of all paths in the set by $1.$

For example,

paths

ABDF

possible crashes

ACD

$A,D,BC,$ or FC

Paths

possible crashes

Compute maximum reduction in the table below and then give the costs for each of the crash options to the right.

In the table below, give the resultant path times after the crashes. Each crash is by $1.$ This is not related to the table above, this is just a stand alone question.