Chinese Postman Problem

Neo4j Graph Platform Graph Algorithms/Graph Data Science
1

Hello together,
does anyone have an idea on how to solve a Chinese postman problem with neo4j?
Actually the problem is I have a starting node(s) and an end node(e). The graph between the start and end node might have cycles. So i would like all shortest path(s) from s to e provided for each path I visit all edges at least once.

regards
Thomas

2

Hi @thomas_stuempfi,

Unfortunately, there's no algorithm in the Neo4j Graph Data Science library that directly solves the Chinese Postman problem. But we'll make a note of your request and will consider adding such an algorithm in the future.

Thank you,
Adam