How to get shortest distance from vertice A to B with edges as path?

Grasshopper
1

proximity weight of vertices with random point as target.gh (40.3 KB)

As titled.
I don’t mean geodesic distance, but shortest path between vertices using edges as paths.

Why I need this?
I like to get proximity attribute of vertices of a non planar mesh to multiple attractors generated on the mesh. Apparently there are many shortest path post on this forum, but oddly enough I could not find vertice to vertice case after hours. So let me just ask, Thanks!

image
image1625×625 110 KB

2

Hi Quan,

Have you taken a look at this before?

I’ve used it successfully for a similar problem but essentially it lets you create graphs from points or lines and can solve between A to B

3

Try with shortest walk plugin

image
image1314×667 101 KB

proximity weight of vertices with random point as target.gh (46.3 KB)

2 Likes
4

Thank you very much! I got it!