Weird result returned by shortest path between two nodes

[tristan...@gmail.com]

Hello !

When I try to get a shortest path between two nodes, i get the following result :

Code :

        System.out.println(g.getShortestPath(8, 28));
        System.out.println(g.getShortestPath(8, 28).whyNotApplicable(g));

Output:

v0 v0 v0 v0 v0 v0 v0 v0 v0 v0 v0 v0 v0 v0 v8 v28
no edge from 0 to 8

Thank you for your help.

PS: This is what my graph looks like : (Node 8 and 28 are on the bottom right)