Programming problem To find the number of path in a graph there is multiple solutions depending on the rules. To solve this problem I have implemented here a first solution with a Dijkstra and another with a dynamic approach.