afni.nimh.nih.gov

Hi,

I am using SurfDist to calculate the shortest distance between nodes on a pial surface, with the "-Graph" option. In terms of the underlying computation, would it be correct to say that SurfDist (using "-graph") determines the shortest distance between nodes using a typical implementation of Dijkstra's algorithm?

Thanks,

Damien.