Data Structures for Coding Interviews in C#/

...

/

Challenge 6: Check if a Path Exists Between Two Vertices

Challenge 6: Check if a Path Exists Between Two Vertices

Given a graph and two vertices, can you write a code to check if a path exists between the two vertices?

We'll cover the following...

Problem statement

You have to implement the bool checkPath(Graph g, int source, int destination) function. It takes a source and a destination and tells you whether or not a path exists between the two (from the source to the destination).

If there is no repeated ...