java and mysql geting shortest path from to two points
- by shaharnakash
hi i have a mysql database that hold id ,name , oneid , twoid , size
1 1 1 2 4
2 2 1 3 1
3 3 2 1 74
4 4 2 4 2
5 5 2 5 12
6 6 4 2 12
7 7 4 6 74
8 8 4 7 12
9 9 3 5 32
10 10 3 8 22
11 11 5 3 66
12 12 5 6 76
13 13 5 9 33
14 14 6 10 11
15 15 6 7 21
16 16 8 3 12
17 17 8 9 10
18 18 9 8 2
19 19 9 10 72
20 20 10 6 31
21 21 10 7 7
22 22 10 9 18
23 23 7 6 8
i want to do Dijkstra algorithm but i cant get the details right
if i got the contents to class Conn id ,name , oneid , twoid , size
how do i find the path from oneid 1 to twoid 7
and believe me i triad many Dijkstra algorithms so please dont give me only reference
