Inputting a graph that uses adjacency-lists and the adjacency matrix, use a method of your own to find five different pa

[answerhappygod]

Inputting a graph that uses adjacency-lists and the adjacency
matrix, use a method of your own to find five different paths from
one (source) node to another (destination) node. List all five
paths and display the total length of each for the five paths, and
compare them to find the longest one and shortest one, then display
them. Hint: Do not implement the Dijkstra's algorithm. This is not
to ask you to implement the Dijkstra's algorithm. When you see the
branches, you can go two different paths until you reach five
paths. Make your graph to be connected.
NB: I don't need a code. I need the diagram and the
solutions.