Caesarean.java

Given a dependency information between various steps of a Caesarean section surgery (as a directed graph that will not have a cycle), the program returns the estimated time to perform such steps (as weights of the corresponding vertices—in minutes), determine the quickest time to complete the whole Caesarean section surgery, i.e. from the first step 0 (the mother is put on anaesthetic) until the last step V -1 (the father sees both the mother and the baby alive) can be completed.