We can parse the input graph, and find the maximum out-degree for any given node. This can be used as a rough estimate for the upper waiting time (multiplied by appropriate factor). At present it is simply a definition in the runtime code of 7sec.
(related to overall timing as relevant for #19)