Purchase Solution

shortest path

Not what you're looking for?

Ask Custom Question

Please see attached for details. You can use either A* or Floyd-Warshall algorithm to accomplish this. One way that I think might work is to divide the path into 3 sections. Finding the shortest path from node 16 to 3 then from 3 to 11 and then from 11 to 16. We also need to find the shortest path from 16 to 11 then from 11 to 3 and from 3 to 16. And then compare the two results.

In terms of programming language you can use any language that you are comfortable with.

Attachments
Purchase this Solution
Solution Summary

Please see attached for details. You can use either A* or Floyd-Warshall algorithm to accomplish this. One way that I think might work is to divide the path into 3 sections. Finding the shortest path from node 16 to 3 then from 3 to 11 and then from 11 to 16. We also need to find the shortest path from 16 to 11 then from 11 to 3 and from 3 to 16. And then compare the two results.

Solution provided by:
Sandeep Bardia, MBA
Education
  • BCom, SGTB Khalsa College, University of Delhi
  • MBA, Rochester Institute of Technology
Recent Feedback
  • "Thank you. "
  • "Thank you"
  • "Thank you. I got 20/20 last week for my discussion you help me out with."
  • "Thank you. Great Job. "
  • "Thank you. Great Job. "
Purchase this Solution
Free BrainMass Quizzes
Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

Probability Quiz

Some questions on probability

Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

View More Free Quizzes
Related BrainMass Solutions

  • Determining Minimum and Shortest Paths: Example Problem

    In each case, list a path providing the minimum value. See attached graph. (a). Shortest-path distance from C to D (b). Shortest-path distance from E to B (c). Shortest-path distance from C to F (d). Minimum path from C to D. (e).

  • Shortest Path and Maximal Flow Problem

    (Shortest Path Problem 15%) Let the numbers on the arcs represent distances and find the shortest path from node 1 to node 9. b.

  • Find the shortest path

    We will try to label all nodes, let's denote by L(v) the length of the shortest path from the node v to the node 7. 1) We can label node 6: as there is a shortest path from node 6 to node 7 with length equaling 5, so L(6)=5; 2) We can label node

  • Critical path

    157501 Why is the critical path not the shortest path through a network, as some people tend to believe? Why is the critical path not the shortest path through a network, as some people tend to believe? Hello, I hope you are doing great.

  • The shortest path

    Using the Pythagoras theorem for the triangle BDC, we get The shortest path is to reach to B and then to C. So, the length of the shortest path is AB+BC= cm The shortest path is determined.

  • Greedy strategy to find shortest path between two vertices

    403623 Greedy strategy to find shortest path between two vertices Consider the following greedy strategy for finding a shortest path from vertex start to vertex goal in a connected graph. 1: Initialize path to start. 2: Initialize VisitedVertices

  • Minimization, maximization (Calculus)

    AJ = = JG Shortest path from A to G = AJG = AJ + JG = 2*AJ = 2* For a = 4 cm, shortest path AJG = 4 = 8.94 cm ..................Ans 2. Longest path from A to G = AH G = AH + HG = a + a = 5.65 + 4 = 9.65 cm ..............Ans 3.

  • Path- Distance (Shortest Route)

    397823 Path- Distance (Shortest Route) Consider the following shortest-route problem involving seven cities. The distances between the cities are given below.

  • Shortest path between two points on a plane.

    146613 Shortest path between two points on a plane. Let A = (0, 1) and B = (3, 2) be points on a plane. What is the length of the shortest path from A to the x-axis to B?

View More Related Solutions