[jgrapht-users] shortest path passing through

[Xavier N. <fx...@ha...>]

I would like to compute the shortest path between A and C passing  
through B. As far as I can tell that is the shortest path between A  
and B joined with the shortest path between B and C.

Is there a known especific algorithm to compute that (albeit maybe  
not in the current API)? Or should I just build it from two calls to  
findPathBetween following the former remark? Efficiency is important  
in this application.

-- fxn