Challenge: Find All Paths Between Two Nodes
Solve the challenge of finding all paths that exist between two nodes of a graph.
We'll cover the following
Problem statement
Implement a function that prints all paths that exist between two nodes (source to destination).
Input
A graph, a source value, and a destination value.
Output
A 2D list having all paths.
Sample input
Graph:
Level up your interview prep. Join Educative to access 80+ hands-on prep courses.