This preview shows pages 1–2. Sign up to view the full content.
Dijkstra’s Algorithm
Dijkstra’s algorithm sometimes called the shortestpath algorithm or forward
algorithm, is centralized, static algorithm, although it can be made adaptive by
executing it have information regarding link costs among the network nodes.
Each node executes Dijkstra’s algorithm to determine the cheapest route to each
network node. In cases where a route cost is simply the number of intermediate nodes,
the cheapest route also the shortest one. The algorithm is an iterative one, building a
set of nodes, one by one, with each iteration. Each node in the set has the property that
the cheapest route to it from the given node is known.
The algorithm can be formally described as follows define:
N
= set of nodes in the network
S
= source node
T
=set of nodes so far incorporated by the algorithm.
W(i,j
)=rom
c
ost from node
i
to node
j
;
w(i, i)=0; w(i, j)=∞
if the two nodes are not
directly connected .
L(n)
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview. Sign up
to
access the rest of the document.
 Winter '09
 NorAini

Click to edit the document details