Subject: Data Structures, Graphs
How to find the minimum distance or path between two vertices in a weighted graph??
I need an algo!!
I have stored my graph in a doubly link list
like this

A - {B 40,C 80}
B - {A 40}
C -{A 80}
where A is the neighbor of B and C with distance between A n B , C equal to 40 and 80 respectively

Question

Subject: Data Structures, Graphs
How to find the minimum distance or path between two vertices in a weighted graph??
I need an algo!!
I have stored my graph in a doubly link list
like this

A -> {B 40,C 80}
B -> {A 40}
C ->{A 80}
where A is the neighbor of B and C with distance between A n B , C equal to 40 and 80 respectively

anonymous · Answer

Dijkstra's algorithm will do the trick =)

anonymous · Answer

While searching I came across several algorithms cant recall their names exactly!! Just got confused confused and confused

Thank you very much I'll check it....and if I'll find some problem then I'll tease u again..:)