[jgrapht-users] Dijktra shorthest problem with subgraphs

[Julien T. de B. <jul...@ep...>]

Hello everyone,
Does someone know why this problem occurs :
Given a ListenableDirectedWeighted graph g. I build the subgraph s from
g. Imagine now I want to check the path between two nodes, A and B
(connected in g but not in s). When I use :
List chemin = DijkstraShortestPath.findPathBetween(s,"A","B");
In chemin, it returns the path in g but not in s.
How is it possible ? Do you know how to solve this problem ? Thanks a
lot for your attention.


-- 
Sincerely,

Julien THOMAS DE BOER
Swiss Federal Institute of Technology of Lausanne (EPFL)