如何设计近似路径解决方案？

I am attempting to write (or expand on an existing) graph search algorithm that will let me find the path to get closest to destination node considering there is no guarantee that the nodes will be connected. I am attempting to write (or expand on an exist