Unique path in a directed graph
Use BFS to work backwards from v, flagging each vertex as 'visited' as you go.  If you ever hit a vertex you've previously visited, your graph doesn't have the uniqueness property.  Otherwise, it does.