0 / 60 seg.

This type of problem, classified as NP-complete, is notoriously difficult when the graph is sufficiently large.