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, which utilizes direct datoms access to implement the traversal algorithm.