$0$ of $20$ points

Chapter $22$: Programming Project $2$

Unlimited tries

$(3)$

$($Find paths$)$

Define a new class named MyGraph that extends the Graph class. The new class contains the getPath method as follows:

def getPath$($self$,$ u$,$ v$)$:

The method returns a list of integer indexes for the vertices in a path from $u$ to $v$ in this order. Using the BFS approach, you can obtain a shortest path from $u$ to $v.$ If there is no path from $u$ to $v,$ the method returns None.

Use