Want this question answered?

Q: Who one of the following algorithm is used in finding shortest distance in a graphs -a) dynamic programming b)greedy method c)backtracking d)divide and conquer?

Write your answer...

Submit

Still have questions?

Continue Learning about Math & Arithmetic

There is not "a" greedy algorithm; "greedy algorithm" is a term to describe several algorithms that have some things in common. The general idea is that at each step, you look for what seems to be, "locally", the best solution. For example, in a shortest-distance problem, look for a step that takes you closer to the destination. This may, or may not, lead to the best solution overall.

Speed = Distance/Time

The horizontal distance is the straight-line distance between two points on a map without including any extra distance because of following the upward and downward slopes of hills and valleys.

The question asks about the "following". In those circumstances would it be too much to expect that you make sure that there is something that is following?

Points: (1, -2) and (1, -5) Distance: 3 units by using the distance formula

Related questions

Distance Vector protocols use the Bellmanâ??Ford algorithm. The ARPANET system relied on Distance Vector protocols as their main routing technique in the early 80s.

This distance-vector algorithm works by computing the shortest path , and considers weights. The algorithm was distributed widely in the RIP protocol.

The distance vector algorithm does not take into account current traffic, type of link, speed of link, type of endpoint routers, etc. It cannot adjust for changes in network traffic and bottlenecks.

Computer programming is somewhat useful in learning the distance formula in Algebra 1. Learning the distance formula has more to do with your ability at mathmetics and you want to learn.

In a sense, it is since your tracking and jogging distance is calculated by an algorithm programmed into it.

When following large trucks, maintain at least a minimum of a ______ second following distance.

Following distance is the space between your vehicle and the vehicle in front of you while driving. Maintaining a safe following distance allows you more time to react to sudden stops or changes in traffic situations, helping to prevent rear-end collisions. The general rule is to keep at least a 3-second distance in good weather conditions, and more in adverse conditions.

The algorithm for bubble sort, also know as pair exchange...Set a swap flag falseLoop for the first N-1 elementsCompare each element with the following elementIf the two elements are in the correct order, continue to next loop iterationOtherwise, swap the two elements and set the swap flag trueAt loop end, if the swap flag is true, repeat starting at step 1Otherwise, sort completedBubble sort is so named because out of order elements "bubble" to the end of the array, moving one step per inner loop iteration.As stated above, the algorithm is slow because it takes a while for a significantly out of order element to reach its final point when it needs to come closer to the beginning of the array. It can be improved by introducing a "distance" parameter, initially set to one half of the array size, and using that distance in step 3 to choose the second element. After the algorithm is completed for that distance, the distance is halved, and we iterate the entire algorithm until the distance is only one. (This variation is more formally known as merge exchange, but it still retains the "bubble" characteristic.)

The technique used for determining the proper following distance is the "3- second" rule.

computing fundamentals and c programming

Latitude is not a climate control factor. Climate is primarily influenced by latitude, altitude, distance from oceans, and distance from mountains.

A practical application is in certain routing protocols, like OSPF. The problem it solves is to search for the "shortest" path to each destination - "shortest" meaning the one that has the lowest "distance" or "metric" according to the criteria used. Dijkstra's algorithm is easy to use and is a good graph search algorithm to use when it is hard to calculate the heuristics.