Microsoft Interview Question

Given a graph, how would you visit every node only once (without visiting any previous nodes)?