# Tag Info

Accepted

### Efficiently updating latest finish times via Critical-Path-Method

The added precedence (arc) will only affect ES and EF for the head node of the arc (node 4 in your example) and its descendants. So you can limit the ES/EF updates to all paths from the head node to ...
• 28.8k

### Logic for Re-Labeling Nodes in a Directed Acyclic Graph

I throw the following out as a possibility, but I am not at all sure that it is practical. Let's say that you have a collection of adjacency matrices $\mathcal{A}$ known to be distinct, and you have a ...
• 28.8k