# Identify all the paths between two nodes

**URL:** <https://discuss.dgraph.io/t/identify-all-the-paths-between-two-nodes/1482>\
**Category:** Users\
**Created:** [May 14, 2017, 9:52am UTC](https://discuss.dgraph.io/t/identify-all-the-paths-between-two-nodes/1482 "2017-05-14T09:52:00Z")\
**Posts on this page:** 1\
**Showing post:** 3

<div class="post-metadata">

**Author:** ![AlBar](https://yyz1.discourse-cdn.com/flex007/user_avatar/discuss.dgraph.io/albar/32/1073_2.png) [@AlBar](https://discuss.dgraph.io/u/AlBar)\
**Post date:** [May 15, 2017, 6:31am UTC](https://discuss.dgraph.io/t/identify-all-the-paths-between-two-nodes/1482/3 "2017-05-15T06:31:47Z")

</div>

thanks @ashwin95r,  
even condidering cyclic graphs is it possible at least if a specify the maximum length of the path)? What do you think of the following 3 solutions proposed on stack overflow?

, ([http://stackoverflow.com/questions/24471136/how-to-find-all-paths-between-two-graph-nodes](http://stackoverflow.com/questions/24471136/how-to-find-all-paths-between-two-graph-nodes))

Thanks

---

_[View the full topic](https://discuss.dgraph.io/t/identify-all-the-paths-between-two-nodes/1482)._