What is the time complexity of the fastest known algorithm for the all-pair shortest paths in planar graphs?



A question regarding the all pair shortest paths in weighted planar graphs
This can be done in quadratic time using the linear-time single-source shortest path algorithm by [Henzinger et al.](http://theory.stanford.edu/~virgi/cs267/papers/planar-sssp.pdf)


