Given a graph: Gn = <V,E> is undirected and bound.
I need to write pseudocode that accepts the following parameters:
An adjacency table which is an array of lists, and two vertices v,u E V.
The code should calculate and return the number of different routes from v to u without circles.

The following functions can be used without the need to implement:
count_edges
celebrity
DFS
BFS
shortest

Many many thanks for the help, I have no idea how to even approach the solution of the question