Find shortest path between a set of nodes in a bipartite graph

Neo4j Graph Platform Graph Algorithms/Graph Data Science
1

Hi,

I want to find all the shortest paths between a set of nodes in a bipartite graph. My graph model is as follows:
image

I want to find shortest paths between B1 and B2 based on A1,A2....An. How can I do that using GDS library?

Thanks a lot!