[jgrapht-users] Semi eulerian path

[Dries De S. <dri...@gm...>]

Hi,

I've been looking for a better way to use jgrapht to find a semi eulerian
path.

In our current implementation I use the hierholzer cycle algorithm by
connecting the vertices I want to find the path between with a "fake" edge
so that it causes the cycle and then rearrange the path it generated to fix
the order, but I'm doubting if there's no algorithm in the jgrapht
implementation that can do this straight away?

Kind regards,

Dries