Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs