school project hlp code

This is a school assignment.

there r 5 nodes.

Graph: AB5, BC4, CD8, DC8, DE6, AD5, CE2, EB3, AE7


The number of trips starting at A and ending at C with exactly 4
stops.
In the sample data below, there are three such trips: A to C (via
B,C,D); A
to C (via D,C,D); and A to C (via D,E,B).

This is a part of my project and need to do it urgently.i'm able to find just shortest path frm a to c