graph algo

cedric clouchoux · Post by **cedric clouchoux** » Tue May 17, 2005 12:14 pm

Hi all!
little question : is there an implementation, somewhere in Aims, of a shortest way algo between 2 vertex in a graph?? (i don't feel looking at all methods names!

)
I'm going to look into aims, but if you have any idea, let me know!
thx a lot

cedric

Post by **riviere** » Tue May 17, 2005 2:19 pm

Hi Cedric,

Well, I think there is no ready to use function coded on graphs. There are some front propagation and connected components algorithms in the sulcus recognition library, but maybe in a specific context.
Don't hesitate to code them and to release them with a nice API

Denis