Information Technology Reference
In-Depth Information
Dijkstra Algorithm in an area of 200
×
200 in metre square
200
20
1
9
1
0
Nodes
Paths b/w nodes
4
5
3
4
4
8
180
2
6
4
7
160
1
8
4
9
3
4
2
7
2
4
1
1
3
2
140
1
5
4
4
1
1
7
2
5
120
3
3
4
3
100
5
3
1
3
7
5
0
1
6
2
1
80
1
3
1
4
60
1
2
9
2
8
23
0
8
40
3
3
6
33
9
1
4
2
3
6
20
2
2
4
6
2
7
4
4
0
0
20
40
60
80
100
120
140
160
180
200
Distance in X-axis in metres
Fig. 7.6
Dijkstra's algorithm showing connectivity in an area of 200 × 200 m
2
(Hop count = 4)
Scattering of nodes in an area of 200
×
200 in metre square
200
1
20
1
0
45
3
4
4
8
180
2
2
6
4
7
160
1
8
3
4
2
7
2
4
49
1
1
3
2
140
4
1
1
5
1
7
4
0
2
5
120
3
3
4
3
100
5
3
1
3
7
50
1
6
2
1
80
1
3
1
4
60
1
2
9
2
8
23
0
8
40
35
36
33
9
1
4
2
3
6
20
2
2
4
6
2
7
4
4
0
0
20
40
60
80
100
120
140
160
180
200
Distance in X-axis in metres
Fig. 7.7
Transmission radius of optimum path of Dijkstra's algorithm in an area of 200 × 200 m
2
Search WWH ::
Custom Search