We study a variant of the classical cop-robber game played on compact metric graphs, where each edge is assigned a positive length and identified with a real interval of corresponding length. In this setting, both the cop and the robber move continuously along the edges, subject to upper bounds on their speeds. The cop has no knowledge of the robber's location and must choose a continuous path through the graph that is guaranteed to intersect the robber's trajectory at some point in time. We show that for every compact metric graph, there exists a constant s > 0 such that if the cop's speed exceeds s times the robber's speed, then the cop can guarantee capture.