It is not difficult find all shortest paths between two nodes in a grapd, it is lengthy. As far as I know the only way to do so is to check all the (open) paths from node1 of length=minimun length and choose those arriving to node2

I have no idea if there is an implementation in some graph library but if you have the description of your graph in a data structure I daresay it is quite easy to implement