Given an undirected graph, determine if there is a path from one node to another.
The input consists of one or more graph specifications. Each
specification consists of three parts. The first part is a line with
the source and target nodes, separated by one space. The second part
is a line consisting of integer n, the number of edges in the graph.
The third part consists of n edges. Each edge is given on a line
and consists of a pair of nodes separated by spaces. All nodes are integers.
For each graph, output true when there is a path between
the source and target nodes, output false otherwise.
Check your solution online
Before you read our solution, try to solve the problem on your own.
Remember that practice makes perfect.
I love to explain and answer questions on programming problems, the kind you find in coding interviews.
I publish a new programming problem and its solution every Sunday.
Did I mention that I love to answer questions?