Return N or all multiple paths for one to one.

[dragonxtek]

I need to calculate all shortests paths from one to one, but in my topology exists severals solutions, not only one (a simply example is when all costs are 0). How can I get all of them? pgr_disjkstra always returns the same one solution and I need all of them.

[cvvergara]

Use pgr_ksp