[jgrapht-users] Chinese Postman Problem

[Frank G. <fra...@fk...>]

Hi,

I'm looking for a library that can solve the Chinese Postman Problem (i.e.
finding a (ideally shortest) route that uses all edges in a graph), either
for undirected graphs, or for mixed graphs. Can JGraphT handle this, or does
anyone know a different library I can use?

My searches only seem to turn up academic papers but no usable code.

Frank

-- 
Frank Gevaerts                                 fra...@fk...
fks bvba - Formal and Knowledge Systems        http://www.fks.be/
Schampbergstraat 32                            Tel:  ++32-(0)11-21 49 11
B-3511 KURINGEN-HASSELT                        Fax:  ++32-(0)11-22 04 19