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

Slope, What is the slope of a line that contains points (2,4) and (-2,-4) ?...

What is the slope of a line that contains points (2,4) and (-2,-4) ?

Define need in marketing in briefly, Define Need in marketing in briefly. ...

Define Need in marketing in briefly. Need is a state of felt deprivation. This includes fundamental physical needs for clothing, food, warmth and also safety; as social needs f

College algebra, Sam has grades of 96,88,86, and 92 on his first four exams...

Sam has grades of 96,88,86, and 92 on his first four exams. What score does he need on his final exam to have an average of at least 90?

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

What is test marketing strategy development, What is Concept Testing Strate...

What is Concept Testing Strategy Development? Test Marketing: Throughout this stage the product is in fact tried out in selected Market Segments only based upon the result

Amazon.com, Whats next for Amazon.com? Is cloud computing the right directi...

Whats next for Amazon.com? Is cloud computing the right direction for the company? Where else can it grow?

Mathematics and baseball, A baseball left fielder throws a baseball from a ...

A baseball left fielder throws a baseball from a position 400 feet from home plate to the third baseman who is 90 feet from home plate. (Assume the two players are in the same lin

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