Get all shortest paths within a distance in an efficient way

[logion2000]

I am very new to LightGraphs as well as Julia. I want to know if LightGraphs can produce all shortest paths from a node to all other nodes within a certain distance in an efficient way? For example, I want to have all shortest paths from node 1 to all other nodes within 2 steps, like A->B->C. C is two steps away from A. iGraph in R can do that, but it is extremely slow and I have a huge graph with more than forty thousand nodes. But igraph is fast in calculating the number of nodes within e.g., 2 steps. But I need the actual paths.
Any help will be appreciated.