Re: [jgrapht-users] Getting an ordered set of edges for graph cycles?

[<org...@io...>]

On Thu, 19 Dec 2013 20:26:38 +0100
"H.N. de Ridder" <hnr...@gr...> wrote:
> 
> If adding an edge u->v to G would create a cycle that wasn't there before, then
> G contains a path v==>u. You can find this path using e.g.
> DijkstraShortestPath, which can tell you both the vertices and edges on the
> path in the proper order (getPath()).
> 
> Hope this helps,
>    Ernst

Ah, thank you. Works perfectly!

M