# Path finding through bipartite graph

Is there a path finding algorithm that exploits a directed bipartite graphs' structure?

I found this: Shortest-Path for Weighted Directed Bipartite Graphs but it didn't seem like the OP needed a bipartite graph and the answer reflected that.

I also found this: https://www.degruyter.com/downloadpdf/j/comp.2013.3.issue-4/s13537-013-0110-4/s13537-013-0110-4.pdf but it's not clear whether the solution is performant and I also don't have a APSP problem.