------------------------------------------------------------------------
Accumulated Comments about HW2
  Important queries/clarification on the homework set
  will be made here.   --hon-wai
------------------------------------------------------------------------


16-August-2002
--------------
Sanjeev:
  Good question. You are right (partially).
  You are required to compute ALL the shortest paths.
  In your example, that means you will need to compute
  both the first two paths.
  However, the question does not require you to
  EXPLICITLY print out all the shortest paths.
Regards, --hon-wai


-----Original Message-----
From: Sanjeev Kumar S [mailto:sanjeevk@comp.nus.edu.sg]
Sent: 16 August 2002 13:02
To: leonghw@comp.nus.edu.sg
Subject: Homework 2 Problem S3 Clarification

Respected Sir,
  With regard to the homework problem S3 given in
  (Homework Set 2) i need a small clarification

  "It is mentioned that modify the Dijkstra
  Algorithm to obtain all shortest paths"

  Does this mean all shortest paths (In terms of cost.This could mean that
  suppose we have s=1 and t=4 and suppose we have paths 1-2-4 ,1-3-4
  ,1-5-2-4 and the costs being say 20,20,30 then we need to display both
  1-2-4 and 1-3-4) OR all shortest paths (in terms of minimum number of
  hops.Using the above example we need to display both 1-2-4 and 1-3-4.)

Please clarify.

Thanks & Regards,
-Sanjeev


--------------------------------------
Started: LeongHW; 15-August-02
--------------------------------------