# How to do graph traversal with rules

**URL:** <https://forum.datomic.com/t/how-to-do-graph-traversal-with-rules/132>\
**Category:** General\
**Created:** [November 7, 2017, 12:48am UTC](https://forum.datomic.com/t/how-to-do-graph-traversal-with-rules/132 "2017-11-07T00:48:42Z")\
**Posts on this page:** 1\
**Showing post:** 2

<div class="post-metadata">

**Author:** ![marshall](https://sea2.discourse-cdn.com/flex016/user_avatar/forum.datomic.com/marshall/32/48_2.png) [@marshall](https://forum.datomic.com/u/marshall)\
**Post date:** [November 7, 2017, 2:43pm UTC](https://forum.datomic.com/t/how-to-do-graph-traversal-with-rules/132/2 "2017-11-07T14:43:17Z")

</div>

Hey Dustin,

Way to break the new-forum-ice!

Presumably you could do this with a recursive rule (assuming your ‘links’ all use the same attribute), but depending on the size of your graph you may prefer an approach like the one Joshua Davey used [here](https://hashrocket.com/blog/posts/using-datomic-as-a-graph-database), which utilizes direct datoms access to implement the traversal algorithm.

---

_[View the full topic](https://forum.datomic.com/t/how-to-do-graph-traversal-with-rules/132)._