Dijkstras algorithm, Marketing Management

Assignment Help:

Let the node at which we are starting be called the initial node. Let the distance of node Y be the distance from the initial node to Y. Dijkstra's algorithm will assign some initial distance values and will try to improve them step by step.

  1. Assign to every node a tentative distance value: set it to zero for our initial node and to infinity for all other nodes.
  2. Mark all nodes unvisited. Set the initial node as current. Create a set of the unvisited nodes called the unvisited set consisting of all the nodes except the initial node.
  3. For the current node, consider all of its unvisited neighbors and calculate their tentative distances. For example, if the current node A is marked with a tentative distance of 6, and the edge connecting it with a neighbor B has length 2, then the distance to B (through A) will be 6+2=8. If this distance is less than the previously recorded tentative distance of B, then overwrite that distance. Even though a neighbor has been examined, it is not marked as visited at this time, and it remains in the unvisited set.
  4. When we are done considering all of the neighbors of the current node, mark the current node as visited and remove it from the unvisited set. A visited node will never be checked again; its distance recorded now is final and minimal.
  5. If the destination node has been marked visited (when planning a route between two specific nodes) or if the smallest tentative distance among the nodes in the unvisited set is infinity (when planning a complete traversal), then stop. The algorithm has finished.
  6. Set the unvisited node marked with the smallest tentative distance as the next "current node" and go back to step 3.

At the beginning of the algorithm, all links are potential, in other words, they are not determined. Links are determined only when required, according to the path reported by the enhanced Dijkstra's algorithm. If a path passes through a potential link, then the potential link would become determined. Once a potential link becomes determined, the number of antennas used by the two end mesh routers of this link is increased by one. In this way, we can eventually obtain a network configuration that satisfies all the traffic demands.


Related Discussions:- Dijkstras algorithm

Mis, what is mis

what is mis

Cost advantage of penetration pricing strategy, How is penetration pricing ...

How is penetration pricing strategy give cost advantage over innovating firm? In the case to outlook penetration pricing strategy is more commercial than financial. It is more

Selling, bwhaviour is like smoke sellers waste useful periods in studying b...

bwhaviour is like smoke sellers waste useful periods in studying buyers behaviour conduct a reasearh on why and highlight five reasons.

Segmentation, With aid of an example of a manufacturer, define segmentation...

With aid of an example of a manufacturer, define segmentation?

International Business and Emerging Markets, Evaluate the case made in the ...

Evaluate the case made in the article for ‘the third leg in the strategy “tripod”’, with particular reference to the effectiveness of the four cases offered in supporting the centr

Brand you, where you want to go in life and how you are going to get there ...

where you want to go in life and how you are going to get there by using social media?

Explain words of schiffman and kanuk for market segmentation, Explain about...

Explain about the words of Schiffman and Kanuk about Market Segmentation. In wordings of Schiffman and Kanuk as, “This is the process of dividing a market within distinct s

Channel - management decisions, Channel - management decisions: after a co...

Channel - management decisions: after a company has chosen alternative, individual   intermediaries' must be selected trained, motivated, and evaluated. Channel arrangements must

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd