Google

Minimum Direction Violations in a Directed Graph

Members only

Given directed edges that may be traversed forward at cost 0 or backward at cost 1, return the minimum number of direction violations from a start node to an end node. The expected solution models bot...