最後一項程式作業 & 調時間上課

[Shyong Jian Shyu]

Dear All:

 

Our last coding assignment is solving the shortest path problem. Your program should be able to solve the following versions of the shortest path problems :

(a) single scource all destinations; and

(b) all pairs

 

The input should be an n*n distance matrix as defined in the Textbook. You may consider the (dense or sparse) as well as (directed or undirected) matrices. Please try your instances for small or large n (say n=3000).

 

All program assignments should be finished and collected in this google groupbefore 6/28 13:00pm.

 

If you guys think this is a good idea, we could 調時間上課 for our last course this semester on 6/23. Maybe we move it to 6/25 (Thu.) or 6/30 (Tue.) even at noon or in the evening.

各位可善用時間準備其他科目的期末考試!!

Surely, we could keep the course at the original time.

 

Please post your availability here (or contact 仙貝) to ease the final decision making.

 

Peace.

 

S. J.

 

[cindy]

6/23的課調到6/30(二)中午12:00，在原教室集合
有沒交作業的都帶來交吧~