Formation
of shortest path tree
• Dijkstra
algorithm is used to find out the
shortest path tree from the graph of nodes and links.
• Calculates
the shortest path between two points on a network, using a graph made up of
nodes and edges.
• Algorithm divides the nodes into two sets:
tentative and permanent.
• It chooses nodes, makes them tentative,
examines them, and if they pass the criteria, makes them permanent.
No comments:
Post a Comment