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

Point-of-purchase advertising, Point-of-Purchase Adver tising T...

Point-of-Purchase Adver tising This is a technique of advertising designed to trigger impulse purchases through the use of eye-catching, attractive displays at the area

Should video game companies continue to alter their , Should video game com...

Should video game companies continue to alter their products to include other functions, such as e-mail?

Elaborate the term brand in brief, Elaborate the term Brand in brief. ...

Elaborate the term Brand in brief. Brand: Brand is nothing but a method of creating an identity for a product somewhat as Amitabh Bachan whose name suggests a certain ide

Main advantages of keeping an in-house is function, Identify FIVE main adva...

Identify FIVE main advantages of keeping an in-house IS function.   There are several significant advantages of maintaining an in-house IS function, five are listed below. H

Prevent corruption in public procurement, According to the 2008 Transparenc...

According to the 2008 Transparency International corruption perception report, Mauritius is ranked 43rd with a score of 5.5 out of 10 and the best among African countries just

Service marketing, explain service marketing and give a company''s example?...

explain service marketing and give a company''s example?

International marketing, Define international marketing and furnish its fea...

Define international marketing and furnish its features

Test Marketing, Explain the various approaches that are followed by FNCG co...

Explain the various approaches that are followed by FNCG companies in test marketing

Assignment, i need to make a assignment

i need to make a assignment

Homework, Suppose a greeting card is 4 inches long on one side. About how l...

Suppose a greeting card is 4 inches long on one side. About how long should the other side of the card be in order for it to be a Golden Rectangle?

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