I have a directed acyclical graph. Each node represents an event with start and end dates and each edge represents a constraint between to events with 2 properties:max interval between previous event end and next event startmin interval between previous event end and next event startWhen an event's date is updated, all edge constraints should be respected and every other event's date should be recalculated if those constraints are violated. Problem is that there might be multiple conflicting constraints and I'm struggling to find best way to traverse the graph updating events without breaking previously satisfied constraints.I have no formal CS education and my knowledge in this area is quite limited. Is there an existing algorithm to solve my problem?
Satisfy edges' constraints when updating node in directed acyclical graph
graph traversal