SHARE
SPREAD
HELP

The Tradition of Sharing

Help your friends and juniors by posting answers to the questions that you know. Also post questions that are not available.

To start with, Sr2Jr’s first step is to reduce the expenses related to education. To achieve this goal Sr2Jr organized the textbook’s question and answers. Sr2Jr is community based and need your support to fill the question and answers. The question and answers posted will be available free of cost to all.

The pleasure of all reading is doubled when one lives with another who shares the same. -Katherine Mansfield

 

#
Authors:
Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser
Chapter:
Graph Algorithms
Exercise:
Exercises
Question:63 | ISBN:9781118771334 | Edition: 6

Question

Consider the following greedy strategy for finding a shortest path from vertex start to vertex goal in a given connected graph.
1: Initialize path to start.
2: Initialize set visited to {start}.
3: If start=goal, return path and exit. Otherwise, continue.
4: Find the edge (start,v) of minimum weight such that v is adjacent to start
    and v is not in visited.
5: Add v to path.
6: Add v to visited.
7: Set start equal to v and go to step 3.
Does this greedy strategy always find a shortest path from start to goal? Either
explain intuitively why it works, or give a counterexample.

TextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbook

Sorry the answer is not available at the moment…

If you are able to find the answer, please make sure to post it here. So that your Juniors have smile on their lips and feel happy.

Spread the 'tradition of sharing'.