# Chinese Postman Problem

**URL:** <https://community.neo4j.com/t/chinese-postman-problem/67985>\
**Category:** Graph Data Science / Graph Analytics\
**Created:** [May 18, 2024, 3:01pm UTC](https://community.neo4j.com/t/chinese-postman-problem/67985 "2024-05-18T15:01:02Z")\
**Posts on this page:** 2\
**Page:** 1

<div class="post-metadata">

**Author:** ![thomas\_stuempfi](https://sea1.discourse-cdn.com/flex021/user_avatar/community.neo4j.com/thomas_stuempfi/32/289_2.png) [@thomas\_stuempfi](https://community.neo4j.com/u/thomas_stuempfi)\
**Post date:** [May 18, 2024, 3:01pm UTC](https://community.neo4j.com/t/chinese-postman-problem/67985/1 "2024-05-18T15:01:02Z")

</div>

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

---

<div class="post-metadata">

**Author:** ![adam\_schill-col](https://sea1.discourse-cdn.com/flex021/user_avatar/community.neo4j.com/adam_schill-col/32/19938_2.png) [@adam\_schill-col](https://community.neo4j.com/u/adam_schill-col)\
**Post date:** [May 21, 2024, 12:17pm UTC](https://community.neo4j.com/t/chinese-postman-problem/67985/2 "2024-05-21T12:17:17Z")

</div>

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