Python

def allPaths(edges, source, destination): return

please do not modify the given.

Problem 2: allPaths A graph is acyclic if there is no cycle in it. Given a directed acyclic graph (DAG) (with at least one edge) and two vertices v, u in the DAG, find all possible paths from v to u. The input graph is represented as a Python list of all edges in the graph. Each edge is a pair (u, v) where u and v indicating there is an edge from vertex u to vertex v. Note: A path is represented as an ordered Python list of vertices (01...,Om] such that for each 1 sis n-1, there is an edge from vi to vi+1. The order of the possible paths in the output does not matter. The return type is a Python list of Python lists. This problem is to get you familiar with graphs. You do not have to use dynamic programming to improve its time complexity. Example: Given the following graph b all possible paths from a to d are [a,b,d] [a,c,d)