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

Marketing, what are advantages and disadvantages of five maketing philosoph...

what are advantages and disadvantages of five maketing philosophies

What is pricing new products, What is pricing new products? Pricing n...

What is pricing new products? Pricing new products: The more new products are unique and take an innovative solution to the satisfaction of a requirement the more delegat

Explain product strategy for ensuring growth of the firm, Question 1: Y...

Question 1: You have been approached by a firm of your choice. You are to provide advice on its marketing planning. Write a report that includes: a. an evaluation of its cu

GE matrix, how do I incorporate GE matrix to the palm oil production?

how do I incorporate GE matrix to the palm oil production?

Test marketing, explain the various approaches that are followed by FMCG co...

explain the various approaches that are followed by FMCG companies in test marketing

Introduction to marketing management, Marketing management: Meaning an...

Marketing management: Meaning and definition: marketing management is a compound word "marketing plus management'. Marketing is the total system of the business activities wh

Case study, How should Shoppers? Stop develop its demand forecasts?

How should Shoppers? Stop develop its demand forecasts?

Describe the leavitts model of change, Question 1: (a) Globalisation re...

Question 1: (a) Globalisation requires new knowledge coordinating structure. Explain and use relevant examples to illustrate your answer. (b) Consider the various competenc

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