globally direct cars on a graph of roads. which car gets priority at a merge? if there are multiple paths to destination, plan routes of all cars to maximally utilize all available roads. how difficult is this problem? need to specify an objective function, and how cars appear (enter), each with its desired destination.
graph of edges. each edge has capacity of 1 car.
inspired by Minecraft mine carts.
No comments :
Post a Comment