From lliao@mail.eecis.udel.edu Wed Nov 16 11:19:01 2005
Date: Wed, 16 Nov 2005 11:19:00 -0500 (EST)
From: Li Liao <lliao@mail.eecis.udel.edu>
Cc: lliao@cis.udel.edu
Subject: Re: cisc320 hw4

As discussed in the class, Dijkstra algorithm calculates the shortest 
distance from the source to all other vertices. So you need to do it for
all other vertices; even if you just specify one vertex as the 
destination, on your way to reach the vertex you already calculate the
shortest distance for those intermediate vertices leading to the 
destination.

I hope this is helpful.

Li


>  For the last question part C. it asks us to execute djikstra's shortest
> path, but we only have A as the source, what's the destination?
>