Obtain Graph (G) from voronoi data for applying Dijkstra's or A* algorithm

Hi,

I made a Voronoi diagram from command "[Vx,Vy] = voronoi(X,Y)" where (X,Y) are the set of cites.

Now, I would like to get a shortest path using Dijkstra's or A* algorithm for which I need to convert voronoi data into a graph matrix.

Please let me know how can I convert voronoi data to a feasible graph matrix so I can apply shortestditance algorithm.

[KALYAN ACHARJYA]

How to ask a question on Matlab Answer? Read here